• Title/Summary/Keyword: Context-based Similarity

Search Result 87, Processing Time 0.026 seconds

Improved Post-Filtering Method Using Context Compensation

  • Kim, Be-Deu-Ro;Lee, Jee-Hyong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.119-124
    • /
    • 2016
  • According to the expansion of smartphone penetration and development of wearable device, personal context information can be easily collected. To use this information, the context aware recommender system has been actively studied. The key issue in this field is how to deal with the context information, as users are influenced by different contexts while rating items. But measuring the similarity among contexts is not a trivial task. To solve this problem, we propose context aware post-filtering to apply the context compensation. To be specific, we calculate the compensation for different context information by measuring their average. After reflecting the compensation of the rating data, the mechanism recommends the items to the user. Based on the item recommendation list, we recover the rating score considering the context information. To verify the effectiveness of the proposed method, we use the real movie rating dataset. Experimental evaluation shows that our proposed method outperforms several state-of-the-art approaches.

A Recommendation System using Context-based Collaborative Filtering (컨텍스트 기반 협력적 필터링을 이용한 추천 시스템)

  • Lee, Se-Il;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.2
    • /
    • pp.224-229
    • /
    • 2011
  • Collaborative filtering is used the most for recommendation systems because it can recommend potential items. However, when there are not many items to be evaluated, collaborative filtering can be subject to the influence of similarity or preference depending on the situation or the whim of the evaluator. In addition, by recommending items only on the basis of similarity with items that have been evaluated previously without relation to the present situation of the user, the recommendations become less accurate. In this paper, in order to solve the above problems, before starting the collaborative filtering procedure, we calculated similarity not by comparing all the values evaluated by users but rather by comparing only those users who were above the average in order to improve the accuracy of the recommendations. In addition, in the ceaselessly changing ubiquitous computing environment, it is not proper to recommend service information based only on the items evaluated by users. Therefore, we used methods of calculating similarity wherein the users' real time context information was used and a high weight was assigned to similar users. Such methods improved the recommendation accuracy by 16.2% on average.

Extended pivot-based approach for bilingual lexicon extraction

  • Seo, Hyeong-Won;Kwon, Hong-Seok;Kim, Jae-Hoon
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.38 no.5
    • /
    • pp.557-565
    • /
    • 2014
  • This paper describes the extended pivot-based approach for bilingual lexicon extraction. The basic features of the approach can be described as follows: First, the approach builds context vectors between a source (or target) language and a pivot language like English, respectively. This is the same as the standard pivot-based approach which is useful for extracting bilingual lexicons between low-resource languages such as Korean-French. Second, unlike the standard pivot-based approach, the approach looks for similar context vectors in a source language. This is helpful to extract translation candidates for polysemous words as well as lets the translations be more confident. Third, the approach extracts translation candidates from target context vectors through the similarity between source and target context vectors. Based on these features, this paper describes the extended pivot-based approach and does various experiments in a language pair, Korean-French (KR-FR). We have observed that the approach is useful for extracting the most proper translation candidate as well as for a low-resource language pair.

An Improved Combined Content-similarity Approach for Optimizing Web Query Disambiguation

  • Kamal, Shahid;Ibrahim, Roliana;Ghani, Imran
    • Journal of Internet Computing and Services
    • /
    • v.16 no.6
    • /
    • pp.79-88
    • /
    • 2015
  • The web search engines are exposed to the issue of uncertainty because of ambiguous queries, being input for retrieving the accurate results. Ambiguous queries constitute a significant fraction of such instances and pose real challenges to web search engines. Moreover, web search has created an interest for the researchers to deal with search by considering context in terms of location perspective. Our proposed disambiguation approach is designed to improve user experience by using context in terms of location relevance with the document relevance. The aim is that providing the user a comprehensive location perspective of a topic is informative than retrieving a result that only contains temporal or context information. The capacity to use this information in a location manner can be, from a user perspective, potentially useful for several tasks, including user query understanding or clustering based on location. In order to carry out the approach, we developed a Java based prototype to derive the contextual information from the web results based on the queries from the well-known datasets. Among those results, queries are further classified in order to perform search in a broad way. After the result provision to users and the selection made by them, feedback is recorded implicitly to improve the web search based on contextual information. The experiment results demonstrate the outstanding performance of our approach in terms of precision 75%, accuracy 73%; recall 81% and f-measure 78% when compared with generic temporal evaluation approach and furthermore achieved precision 86%, accuracy 71%; recall 67% and f-measure 75% when compared with web document clustering approach.

An Efficient Object Augmentation Scheme for Supporting Pervasiveness in a Mobile Augmented Reality

  • Jang, Sung-Bong;Ko, Young-Woong
    • Journal of Information Processing Systems
    • /
    • v.16 no.5
    • /
    • pp.1214-1222
    • /
    • 2020
  • Pervasive augmented reality (AR) technology can be used to efficiently search for the required information regarding products in stores through text augmentation in an Internet of Things (IoT) environment. The evolution of context awareness and image processing technologies are the main driving forces that realize this type of AR service. One of the problems to be addressed in the service is that augmented objects are fixed and cannot be replaced efficiently in real time. To address this problem, a real-time mobile AR framework is proposed. In this framework, an optimal object to be augmented is selected based on object similarity comparison, and the augmented objects are efficiently managed using distributed metadata servers to adapt to the user requirements, in a given situation. To evaluate the feasibility of the proposed framework, a prototype system was implemented, and a qualitative evaluation based on questionnaires was conducted. The experimental results show that the proposed framework provides a better user experience than existing features in smartphones, and through fast AR service, the users are able to conveniently obtain additional information on products or objects.

PageRank Algorithm Using Link Context (링크내역을 이용한 페이지점수법 알고리즘)

  • Lee, Woo-Key;Shin, Kwang-Sup;Kang, Suk-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.7
    • /
    • pp.708-714
    • /
    • 2006
  • The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.

Sentence model based subword embeddings for a dialog system

  • Chung, Euisok;Kim, Hyun Woo;Song, Hwa Jeon
    • ETRI Journal
    • /
    • v.44 no.4
    • /
    • pp.599-612
    • /
    • 2022
  • This study focuses on improving a word embedding model to enhance the performance of downstream tasks, such as those of dialog systems. To improve traditional word embedding models, such as skip-gram, it is critical to refine the word features and expand the context model. In this paper, we approach the word model from the perspective of subword embedding and attempt to extend the context model by integrating various sentence models. Our proposed sentence model is a subword-based skip-thought model that integrates self-attention and relative position encoding techniques. We also propose a clustering-based dialog model for downstream task verification and evaluate its relationship with the sentence-model-based subword embedding technique. The proposed subword embedding method produces better results than previous methods in evaluating word and sentence similarity. In addition, the downstream task verification, a clustering-based dialog system, demonstrates an improvement of up to 4.86% over the results of FastText in previous research.

Question Similarity Measurement of Chinese Crop Diseases and Insect Pests Based on Mixed Information Extraction

  • Zhou, Han;Guo, Xuchao;Liu, Chengqi;Tang, Zhan;Lu, Shuhan;Li, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.3991-4010
    • /
    • 2021
  • The Question Similarity Measurement of Chinese Crop Diseases and Insect Pests (QSM-CCD&IP) aims to judge the user's tendency to ask questions regarding input problems. The measurement is the basis of the Agricultural Knowledge Question and Answering (Q & A) system, information retrieval, and other tasks. However, the corpus and measurement methods available in this field have some deficiencies. In addition, error propagation may occur when the word boundary features and local context information are ignored when the general method embeds sentences. Hence, these factors make the task challenging. To solve the above problems and tackle the Question Similarity Measurement task in this work, a corpus on Chinese crop diseases and insect pests(CCDIP), which contains 13 categories, was established. Then, taking the CCDIP as the research object, this study proposes a Chinese agricultural text similarity matching model, namely, the AgrCQS. This model is based on mixed information extraction. Specifically, the hybrid embedding layer can enrich character information and improve the recognition ability of the model on the word boundary. The multi-scale local information can be extracted by multi-core convolutional neural network based on multi-weight (MM-CNN). The self-attention mechanism can enhance the fusion ability of the model on global information. In this research, the performance of the AgrCQS on the CCDIP is verified, and three benchmark datasets, namely, AFQMC, LCQMC, and BQ, are used. The accuracy rates are 93.92%, 74.42%, 86.35%, and 83.05%, respectively, which are higher than that of baseline systems without using any external knowledge. Additionally, the proposed method module can be extracted separately and applied to other models, thus providing reference for related research.

An Efficient Conceptual Clustering Scheme (효율적인 개념 클러스터링 기법)

  • Yang, Gi-Chul
    • Journal of Korea Entertainment Industry Association
    • /
    • v.14 no.4
    • /
    • pp.349-354
    • /
    • 2020
  • This paper, firstly, propose a new Clustering scheme Based on Conceptual graphs (CBC) that can describe objects freely and can perform clustering efficiently. The conceptual clustering is one of machine learning technique. The similarity among the objects in conceptual clustering are decided on the bases of concept membership, unlike the general clustering scheme which decide the similarity without considering the context or environment of the objects. A new conceptual clustering scheme, CBC, which can perform efficient conceptual clustering by describing various objects freely with conceptual graphs is introduced in this paper.

An Analysis of Similarities that Students Construct in the Process of Problem Solving (중학생들이 수학 문장제 해결 과정에서 구성하는 유사성 분석)

  • Park Hyun-Jeong;Lee Chong-Hee
    • Journal of Educational Research in Mathematics
    • /
    • v.16 no.2
    • /
    • pp.115-138
    • /
    • 2006
  • The purpose of this paper is to investigate students' constructing similarities in the understanding the problem phase and the devising a plan phase of problem solving. the relation between similarities that students construct and how students construct similarities is researched through case study. Based on the results from the research, authors reached a conclusion as following. All of two students constructed surface similarities in the beginning of the problem solving process and responded to the context of the problem information sensitively. Specially student who constructed the similarities and the difference in terms of a specific dimension by using diagram for herself could translate the equation which used to solve the base problem or the experienced problem into the equation of the target problem solution. However student who understood globally the target problem being based on the surface similarity could not translate the equation that she used to solve the base problem into the equation of target problem solution.

  • PDF