• Title/Summary/Keyword: Search Ranking

Search Result 173, Processing Time 0.018 seconds

A Similarity Ranking Algorithm for Image Databases (이미지 데이터베이스 유사도 순위 매김 알고리즘)

  • Cha, Guang-Ho
    • Journal of KIISE:Databases
    • /
    • v.36 no.5
    • /
    • pp.366-373
    • /
    • 2009
  • In this paper, we propose a similarity search algorithm for image databases. One of the central problems regarding content-based image retrieval (CBIR) is the semantic gap between the low-level features computed automatically from images and the human interpretation of image content. Many search algorithms used in CBIR have used the Minkowski metric (or $L_p$-norm) to measure similarity between image pairs. However those functions cannot adequately capture the aspects of the characteristics of the human visual system as well as the nonlinear relationships in contextual information. Our new search algorithm tackles this problem by employing new similarity measures and ranking strategies that reflect the nonlinearity of human perception and contextual information. Our search algorithm yields superior experimental results on a real handwritten digit image database and demonstrates its effectiveness.

Implementation of Search Method based on Sequence and Adjacency Relationship of User Query (사용자 검색 질의 단어의 순서 및 단어간의 인접 관계에 기반한 검색 기법의 구현)

  • So, Byung-Chul;Jung, Jin-Woo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.724-729
    • /
    • 2011
  • Information retrieval is a method to search the needed data by users. Generally, when a user searches some data in the large scale data set like the internet, ranking-based search is widely used because it is not easy to find the exactly needed data at once. In this paper, we propose a novel ranking-based search method based on sequence and adjacency relationship of user query by the help of TF-IDF and n-gram. As a result, it was possible to find the needed data more accurately with 73% accuracy in more than 19,000 data set.

Personalized Search Service in Semantic Web (시멘틱 웹 환경에서의 개인화 검색)

  • Kim, Je-Min;Park, Young-Tack
    • The KIPS Transactions:PartB
    • /
    • v.13B no.5 s.108
    • /
    • pp.533-540
    • /
    • 2006
  • The semantic web environment promise semantic search of heterogeneous data from distributed web page. Semantic search would resuit in an overwhelming number of results for users is increased, therefore elevating the need for appropriate personalized ranking schemes. Culture Finder helps semantic web agents obtain personalized culture information. It extracts meta data for each web page(culture news, culture performance, culture exhibition), perform semantic search and compute result ranking point to base user profile. In order to work efficient, Culture Finder uses five major technique: Machine learning technique for generating user profile from user search behavior and meta data repository, an efficient semantic search system for semantic web agent, query analysis for representing query and query result, personalized ranking method to provide suitable search result to user, upper ontology for generating meta data. In this paper, we also present the structure used in the Culture Finder to support personalized search service.

Dataset Search System Using Metadata-Based Ranking Algorithm (메타데이터 기반 순위 알고리즘을 활용한 데이터셋 검색 시스템)

  • Choi, Wooyoung;Chun, Jonghoon
    • Journal of Broadcast Engineering
    • /
    • v.27 no.4
    • /
    • pp.581-592
    • /
    • 2022
  • Recently, as the requirements for using big data have increased, interest in dataset search technology needed for data analysis is also growing. Although it is necessary to proactively utilize metadata, unlike conventional text search, research on such dataset search systems has not been actively carried out. In this paper, we propose a new dataset-tailored search system that indexes metadata of datasets and performs dataset search based on metadata indices. The ranking given to the dataset search results from a newly devised algorithm that reflects the unique characteristics of the dataset. The system provides the capability to search for additional datasets which correlate with the dataset searched by the user-submitted query so that multiple datasets needed for analysis can be found at once.

An Evaluation of Twitter Ranking Using the Retweet Information (재전송 정보를 활용한 트위터 랭킹의 정확도 평가)

  • Chang, Jae-Young
    • The Journal of Society for e-Business Studies
    • /
    • v.17 no.2
    • /
    • pp.73-85
    • /
    • 2012
  • Recently, as Social Network Services(SNS), such as Twitter, Facebook, are becoming more popular, much research has been doing actively. However, since SNS has been launched recently, related researches are also infant level. Especially, search engines serviced in web potals simply show the postings in order of upload time. Searching the postings in Twitter should be different from web search, which is based on traditional TF-IDF. In this paper, we present the new method of searching and ranking the interesting postings in Twitter. In proposed method, we utilize the frequency of retweets as a major factor for estimating the quality of postings. It can be an important criteria since users tend to retweet the valuable postings. Experimental results show that proposed method can be applied successfully in Twitter search system.

A Prototype Model for Handling Fuzzy Query in Voice Search on Smartphones (스마트폰의 음성 검색에서 퍼지 쿼리 처리를 위한 프로토타입 모델)

  • Choi, Dae-Young
    • The KIPS Transactions:PartD
    • /
    • v.18D no.4
    • /
    • pp.309-312
    • /
    • 2011
  • Handling fuzzy query in voice search on smartphones is one of the most difficult problems. It is mainly derived from the complexity and the degree of freedom of natural language. To reduce the complexity and the degree of freedom of fuzzy query in voice search on smartphones, attribute-driven approach for fuzzy query is proposed. In addition, a new page ranking algorithm based on the values of attributes for handling fuzzy query is proposed. It provides a smartphone user with location-based personalized page ranking based on user's search intentions. It is a further step toward location-based personalized web search for smartphone users. In this paper, we design a prototype model for handling fuzzy query in voice search on smartphones and show the experimental results of the proposed approach compared to existing smartphones.

Development of a Ranking System for Tourist Destination Using BERT-based Semantic Search (BERT 기반 의미론적 검색을 활용한 관광지 순위 시스템 개발)

  • KangWoo Lee;MyeongSeon Kim;Soon Goo Hong;SuGyeong Roh
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.29 no.4
    • /
    • pp.91-103
    • /
    • 2024
  • A tourist destination ranking system was designed that employs a semantic search to extract information with reasonable accuracy. To this end the process involves collecting data, preprocessing text reviews of tourist spots, and embedding the corpus and queries with SBERT. We calculate the similarity between data points, filter out those below a specified threshold, and then rank the remaining tourist destinations using a count-based algorithm to align them semantically with the query. To assess the efficacy of the ranking algorithm experiments were conducted with four queries. Furthermore, 58,175 sentences were directly labeled to ascertain their semantic relevance to the third query, 'crowdedness'. Notably, human-labeled data for crowdedness showed similar results. Despite challenges including optimizing thresholds and imbalanced data, this study shows that a semantic search is a powerful method for understanding user intent and recommending tourist destinations with less time and costs.

Optimal Design of Reporting Cell Location Management System using Ranking Ant Colony System (랭킹개미군전략을 이용한 리포팅셀 위치관리시스템 최적 설계)

  • Kim, Sung-Soo;Kim, Geun-Bae
    • IE interfaces
    • /
    • v.19 no.2
    • /
    • pp.168-173
    • /
    • 2006
  • In the Reporting Cell Location Management (RCLM) system, a subset of cells in the network is designated as the reporting cells. Each mobile terminal performs location update only when it enters one of these reporting cells. When a call arrives, the paging is confined to the reporting cell the user last reported and the neighboring bounded non-reporting cells. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. We must decide the number of reporting cells and which cell should be reporting cell to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. This paper proposes a ranking ant colony system (RACS) for optimization of RCLM system.

Design of Advanced HITS Algorithm by Suitability for Importance-Evaluation of Web-Documents (웹 문서 중요도 평가를 위한 적합도 향상 HITS 알고리즘 설계)

  • 김분희;한상용;김영찬
    • The Journal of Society for e-Business Studies
    • /
    • v.8 no.2
    • /
    • pp.23-31
    • /
    • 2003
  • Link-based search engines generate the rank using linked information of related web-documents . HITS(Hypertext Internet Topic Search), representative ranking evaluation algorithm using a special feature of web-documents based on such link, evaluates the importance degree of related pages from linked information and presents by ranking information. Problem of such HITS algorithm only is considered the link frequency within documents and depends on the set of web documents as input value. In this paper, we design the search agent based on better HITS algorithm according to advanced suitability between query and search-result in the set of given documents from link-based web search engine. It then complements locality of advanced search performance and result.

  • PDF

Ranking Methods of Web Search using Genetic Algorithm (유전자 알고리즘을 이용한 웹 검색 랭킹방법)

  • Jung, Yong-Gyu;Han, Song-Yi
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.3
    • /
    • pp.91-95
    • /
    • 2010
  • Using artificial neural network to use a search preference based on the user's information, the ranking of search results that will enable flexible searches can be improved. After trained in several different queries by other users in the past, the actual search results in order to better reflect the use of artificial neural networks to neural network learning. In order to change the weights constantly moving backward in the network to change weights of backpropagation algorithm. In this study, however, the initial training, performance data, look for increasing the number of lessons that can be overfitted. In this paper, we have optimized a lot of objects that have a strong advantage to apply genetic algorithms to the relevant page of the search rankings flexible as an object to the URL list on a random selection method is proposed for the study.