• Title/Summary/Keyword: search similarity

Search Result 535, Processing Time 0.028 seconds

Sequencing of cDNA Clones Expressed in Adipose Tissues of Korean Cattle

  • Bong, J.J.;Tong, K.;Cho, K.K.;Baik, M.G.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.18 no.4
    • /
    • pp.483-489
    • /
    • 2005
  • To understand the molecular mechanisms that regulate intramuscular fat deposition and its release, cDNA clones expressed in adipose tissues of Korean cattle were identified by differential screening from adipose tissue cDNA library. By partial nucleotide sequencing of 486 clones and a search for sequence similarity in NCBI nucleotide databases, 245 clones revealed unique clones. By a functional grouping of the clones, 14% of the clones were categorized to metabolism and enzyme-related group (stearoyl CoA desaturase, lactate dehydrogenase, fatty acid synthase, ATP citrate lyase, lipoprotein lipase, acetyl CoA synthetase, etc), and 6% to signal transduction/cell cycle-related group (C/EBP, cAMP-regulated phosphoprotein, calmodulin, cyclin G1, cyclin H, etc), and 4% to cytoskeleton and extracellular matrix components (vimentin, ankyrin 2, gelosin, syntenin, talin, prefoldin 5). The obtained 245 clones will be useful to study lipid metabolism and signal transduction pathway in adipose tissues and to study obesity in human. Some clones were subjected to full-sequencing containing open reading frame. The cDNA clone of bovine homolog of human prefoldin 5 gene had a total length of 959 nucleotides coding for 139 amino acids. Comparison of the deduced amino acid sequences of bovine prefoldin 5 with those of human and mouse showed over 95% identity. The cDNA clone of bovine homolog of human ubiquitin-like/S30 ribosomal fusion protein gene had a total length of 484 nucleotides coding for 133 amino acids. Comparison of the deduced amino acid sequences of bovine ubiquitin-like/S30 ribosomal fusion protein gene with those of human, rat and mouse showed over 97% identity. The cDNA clone of bovine homolog of human proteolipid protein 2 mRNA had a total length of 928 nucleotides coding for 152 amino acids. Comparison of the deduced amino acid sequences of bovine proteolipid protein 2 with those of human and mouse showed 87.5% similarity. The cDNA clone of bovine homolog of rat thymosin beta 4 had a total length of 602 nucleotides coding for 44 amino acids. Comparison of the deduced amino acid sequences of bovine thymosin beta 4 gene with those of human, mouse and rat showed 93.1% similarity. The cDNA clone of bovine homolog of human myotrophin mRNA had a total length of 790 nucleotides coding for 118 amino acids. Comparison of the deduced amino acid sequences of bovine myotrophin gene with those of human, mouse and rat showed 83.9% similarity. The functional role of these clones in adipose tissues needs to be established.

A Multimodal Profile Ensemble Approach to Development of Recommender Systems Using Big Data (빅데이터 기반 추천시스템 구현을 위한 다중 프로파일 앙상블 기법)

  • Kim, Minjeong;Cho, Yoonho
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.93-110
    • /
    • 2015
  • The recommender system is a system which recommends products to the customers who are likely to be interested in. Based on automated information filtering technology, various recommender systems have been developed. Collaborative filtering (CF), one of the most successful recommendation algorithms, has been applied in a number of different domains such as recommending Web pages, books, movies, music and products. But, it has been known that CF has a critical shortcoming. CF finds neighbors whose preferences are like those of the target customer and recommends products those customers have most liked. Thus, CF works properly only when there's a sufficient number of ratings on common product from customers. When there's a shortage of customer ratings, CF makes the formation of a neighborhood inaccurate, thereby resulting in poor recommendations. To improve the performance of CF based recommender systems, most of the related studies have been focused on the development of novel algorithms under the assumption of using a single profile, which is created from user's rating information for items, purchase transactions, or Web access logs. With the advent of big data, companies got to collect more data and to use a variety of information with big size. So, many companies recognize it very importantly to utilize big data because it makes companies to improve their competitiveness and to create new value. In particular, on the rise is the issue of utilizing personal big data in the recommender system. It is why personal big data facilitate more accurate identification of the preferences or behaviors of users. The proposed recommendation methodology is as follows: First, multimodal user profiles are created from personal big data in order to grasp the preferences and behavior of users from various viewpoints. We derive five user profiles based on the personal information such as rating, site preference, demographic, Internet usage, and topic in text. Next, the similarity between users is calculated based on the profiles and then neighbors of users are found from the results. One of three ensemble approaches is applied to calculate the similarity. Each ensemble approach uses the similarity of combined profile, the average similarity of each profile, and the weighted average similarity of each profile, respectively. Finally, the products that people among the neighborhood prefer most to are recommended to the target users. For the experiments, we used the demographic data and a very large volume of Web log transaction for 5,000 panel users of a company that is specialized to analyzing ranks of Web sites. R and SAS E-miner was used to implement the proposed recommender system and to conduct the topic analysis using the keyword search, respectively. To evaluate the recommendation performance, we used 60% of data for training and 40% of data for test. The 5-fold cross validation was also conducted to enhance the reliability of our experiments. A widely used combination metric called F1 metric that gives equal weight to both recall and precision was employed for our evaluation. As the results of evaluation, the proposed methodology achieved the significant improvement over the single profile based CF algorithm. In particular, the ensemble approach using weighted average similarity shows the highest performance. That is, the rate of improvement in F1 is 16.9 percent for the ensemble approach using weighted average similarity and 8.1 percent for the ensemble approach using average similarity of each profile. From these results, we conclude that the multimodal profile ensemble approach is a viable solution to the problems encountered when there's a shortage of customer ratings. This study has significance in suggesting what kind of information could we use to create profile in the environment of big data and how could we combine and utilize them effectively. However, our methodology should be further studied to consider for its real-world application. We need to compare the differences in recommendation accuracy by applying the proposed method to different recommendation algorithms and then to identify which combination of them would show the best performance.

Membership Management based on a Hierarchical Ring for Large Grid Environments

  • Gu, Tae-Wan;Hong, Seong-Jun;Uhmn, Saang-Yong;Lee, Kwang-Mo
    • Journal of Information Processing Systems
    • /
    • v.3 no.1
    • /
    • pp.8-15
    • /
    • 2007
  • Grid environments provide the mechanism to share heterogeneous resources among nodes. Because of the similarity between grid environments and P2P networks, the structures of P2P networks can be adapted to enhance scalability and efficiency in deployment and to search for services. In this paper, we present a membership management based on a hierarchical ring which constructs P2P-like Grid environments. The proposed approach uses only a limited number of connections, reducing communication cost. Also, it only keeps local information for membership, which leads to a further reduction in management cost. This paper analyzes the performance of the approach by simulation and compares it with other approaches.

A Study on the Neural Network for the Character Recognition (문자인식을 위한 신경망컴퓨터에 관한 연구)

  • 이창기;전병실
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.8
    • /
    • pp.1-6
    • /
    • 1992
  • This paper proposed a neural computer architecture for the learning of script character pattern recognition categories. Oriented filter with complex cells preprocess about the input script character, abstracts contour from the character. This contour normalized and inputed to the ART. Top-down attentional and matching mechanisms are critical in self-stabilizing of the code learning process. The architecture embodies a parallel search scheme that updates itself adaptively as the learning process unfolds. After learning ART self-stabilizes, recognition time does not grow as a function of code complexity. Vigilance level shows the similarity between learned patterns and new input patterns. This character recognition system is designed to adaptable. The simulation of this system showed satisfied result in the recognition of the hand written characters.

  • PDF

An Efficient Algorithm for Similarity Search using Positional Information of DNA Sequences (DNA 서열의 위치 정보를 이용한 효율적인 유사성 검색 알고리즘)

  • Jeong In-Seon;Park Kyoung-Wook;Lim Hyeong-Seok
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.970-972
    • /
    • 2005
  • 유전자 데이터베이스의 서열의 길이가 수백만에서 수백억 정도의 대용량 텍스트이기 때문에 기존의 Smith-waterman 알고리즘으로 정확한 서열의 유사성을 검색하는 것은 매우 비효율적이다. 따라서 빠른 유사성 검색을 위해 데이터베이스에 저장된 문자열에 대해 특정 길이의 모든 부분문자열에 나타나는 문자의 출현 빈도를 이용한 휴리스틱 방법들이 제안되었다. 이러한 방법들은 질의 서열과 일치될 가능성이 높은 후보들만을 추출한 후 이들 각각에 대하여 질의 서열과의 일치 여부를 조사하므로 빠르게 유사성 검색을 할 수 있다. 그러나 이 방법은 문자의 출현 빈도만을 사용하므로 서로 다른 서열을 같은 서열로 취급하는 단점이 있어 정확도가 Smith-Waterman 알고리즘에 비해 떨어진다. 본 논문에서는 문자가 부분문자열에 나타나는 위치 정보를 포함하여 문자의 출현빈도를 인덱싱함으로써 질의 처리를 효율적으로 수행하는 알고리즘을 제안한다. 실험결과 제안된 알고리즘은 문자 빈도만을 사용하는 알고리즘에 비해 $5\~15\%$정도 정확성이 향상되었다.

  • PDF

Social Network Analysis and Its Applications for Authors and Keywords in the JKSS

  • Kim, Jong-Goen;Choi, Soon-Kuek;Choi, Yong-Seok
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.4
    • /
    • pp.547-558
    • /
    • 2012
  • Social network analysis is a graphical technique to search the relationships and characteristics of nodes (people, companies, and organizations) and an important node for positioning a visualized social network figure; however, it is difficult to characterize nodes in a social network figure. Therefore, their relationships and characteristics could be presented through an application of correspondence analysis to an affiliation matrix that is a type of similarity matrix between nodes. In this study, we provide the relationships and characteristics around authors and keywords in the JKSS(Journal of the Korean Statistical Society) of the Korean Statistical Society through the use of social network analysis and correspondence analysis.

Prediction and Analysis of Ligands against Estrogen Related Receptor Alpha

  • Chitrala, Kumaraswamy Naidu;Yeguvapalli, Suneetha
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.14 no.4
    • /
    • pp.2371-2375
    • /
    • 2013
  • Breast cancer is one of the most common malignancies in women around the world. Among the various hormonal types of breast cancer, those that are estrogen receptor (ER) positive account for the majority. Among the estrogen related receptors, estrogen related receptor ${\alpha}$ is known to have a potential role in breast cancer and is one of the therapeutic target. Hence, prediction of novel ligands interact with estrogen related receptor alpha is therapeutically important. The present study, aims at prediction and analysis of ligands from the KEGG COMPOUND database (containing 10,739 entries) able to interact against estrogen receptor alpha using a similarity search and molecular docking approach.

Signal Processing for Perpendicular Recording Systems

  • Lee, Jun;Woo, Choong-Chae
    • Journal of IKEEE
    • /
    • v.15 no.1
    • /
    • pp.70-75
    • /
    • 2011
  • Longitudinal recording has been the cornerstone of all two generations of magnetic recording systems, FDD and HDD. In recent, perpendicular recording has received much attention as promising technology for future high-density recording system Research into signal processing techniques is paramount for the issued storage system and is indispensable like longitudinal recording systems. This paper focuses on the performance evaluation of the various detectors under perpendicular recording system. Parameters for improving the their performance are examined for some detectors. Detectors considered in this work are the partial response maximum likelihood (PRML), noise-predictive maximum likelihood (NPML), fixed delay tree search with decision feedback (FDTS/DF), dual decision feedback equalizer (DDFE) and multilevel decision feedback equalizer (MDFE). Their performances are analyzed in terms of mean squared error (MSE) and noise power spectra, and similarity between recording channel and partial response (PR) channel.

Automatic Prediction of 'Anti-Search Variants' of Twitter based on Word Embeddings and Phonetic Similarity (단어 임베딩과 음성적 유사도를 이용한 트위터 '서치 방지 단어'의 자동 예측)

  • Lee, Sangah
    • Annual Conference on Human and Language Technology
    • /
    • 2017.10a
    • /
    • pp.190-193
    • /
    • 2017
  • '서치 방지 단어'는 SNS 상에서 사용자들이 작성한 문서의 검색 및 수집을 피하기 위하여 사용하는 변이형을 뜻한다. 하나의 검색 키워드가 있다면 그와 같은 대상을 나타내는 변이형이 여러 형태로 존재할 수 있으며, 이들 변이형에 대한 검색 결과를 함께 수집할 수 있다면 데이터 확보가 중요하게 작용하는 다양한 연구에 큰 도움이 될 것이다. 본 연구에서는 특정 단어가 주어진 키워드로부터 의미 벡터 상의 거리가 가까울수록, 그리고 주어진 키워드와 비슷한 음성적 형태 즉 발음을 가질수록, 해당 키워드의 변이형일 가능성이 높을 것이라고 가정하였다. 이에 따라 단어 임베딩을 이용한 의미 유사도와 최소 편집 거리를 응용한 음성적 유사도를 이용하여 주어진 검색 키워드와 유사한 변이형들을 제안하고자 하였다. 그 결과 구성된 변이형 후보의 목록에는 다양한 형태의 단어들이 포함되었으며, 이들 중 다수가 실제 SNS 상에서 같은 의미로 사용되고 있음이 확인되었다.

  • PDF

A Study on the Automatic Document Segmentation using Stochastic Method (확률기법을 이용한 자동 문서 분할에 관한 연구)

  • 음호식;이명호
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.1
    • /
    • pp.82-89
    • /
    • 2001
  • It is a document segmentation to set a boundary in the documents by the contents. It is essential for the accurate and efficient information search. In this paper we want to make an automatic document segmentation system with the method of probability analysis which uses the mutual information between the words. Proposed system can move the boundary of window and compute the similarity or the two window. In this system the more words are shared and the more important the words are, the higher the cohesive force of the two window systems goes. The result of experience with the document segmentation is that despite the differences of block unit the division point at which we expected to divide was normally divided.

  • PDF