• Title/Summary/Keyword: Meta Search

Search Result 787, Processing Time 0.045 seconds

Buyer Category-Based Intelligent e-Commerce Meta-Search Engine (구매자 카테고리 기반 지능형 e-Commerce 메타 서치 엔진)

  • Kim, Kyung-Pil;Woo, Sang-Hoon;Kim, Chang-Ouk
    • IE interfaces
    • /
    • v.19 no.3
    • /
    • pp.225-235
    • /
    • 2006
  • In this paper, we propose an intelligent e-commerce meta-search engine which integrates distributed e-commerce sites and provides a unified search to the sites. The meta-search engine performs the following functions: (1) the user is able to create a category-based user query, (2) by using the WordNet, the query is semantically refined for increasing search accuracy, and (3) the meta-search engine recommends an e-commerce site which has the closest product information to the user’s search intention by matching the user query with the product catalogs in the e-commerce sites linked to the meta-search engine. An experiment shows that the performance of our model is better than that of general keyword-based search.

User Category-Based Intelligent e-Commerce Meta-Search Engine

  • U, Sang-Hun;Kim, Gyeong-Pil;Kim, Chang-Uk
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.11a
    • /
    • pp.346-355
    • /
    • 2005
  • In this paper, we propose a meta-search engine which provides distributed product information through a unified access to multiple e-commerce. The meta-search engine proposed in this paper performs the following functions: (I) The user is able to create a category-based user query, (2) by using the WordNet, the query is semantical refined fined for increasing search accuracy, and (3) the meta-search engine recommends an e-commerce site which has the closest product information to the user's search intention, by matching the user query with the product catalogs in the e-commerce sites linked to the meta-search engine. An experiment shows that the performance of our model is better than that of general keyword-based search.

  • PDF

A Study on the Characteristics of Meta Search Engines (메타검색엔진의 특징에 관한 연구)

  • 이란주
    • Journal of the Korean Society for information Management
    • /
    • v.17 no.2
    • /
    • pp.85-100
    • /
    • 2000
  • Meta search engines have been used as the first engine because they let users several search engines at once for their queries and give them the search results. The purpose of this study is to examine the features and functions of 17 meta search engines in order that it helps users select and execute effective searches on meta search engines. Each selected engine is analyzed based on the criteria evaluating both meta search engines and general search engines. The results show that each meta search engine has its own characteristics while there are common features among them. It is expected that the results of this study will help users utilize meta search engines and provide meta search engine designer basic ideas.

  • PDF

A Study on the Construction and Usability Test of Meta Search System Using Open API (Open API 기반 메타 검색시스템의 사용성 평가에 관한 연구)

  • Lee, Jung-Eok;Lee, Eung-Bong
    • Journal of the Korean Society for information Management
    • /
    • v.26 no.1
    • /
    • pp.185-214
    • /
    • 2009
  • The purpose of this study is aimed to clarify the usefulness of meta search system using Open API of library online catalog by constructing OPAC-based search system using Open API of library online catalog and meta search system using Open API of library online catalog, and comparing the usability of the two experimental search systems. As for usability, on the whole, it was higher in meta search system using Open API of library online catalog than OPAC-based search system using Open API of library online catalog, and there was statistically significant difference. Therefore, if libraries share and use enriched content which is provided through Open API for book search, which is opened by Internet bookstores, search engines and Web portals, it is expected that it will be helpful in enhancing bibliographic data, expanding subject access point, empowering subject search ability, extending meta search service, improving book availability, and reducing catalog cost.

The study on the retrieval effectiveness of meta-search engine on the internet (인터넷상의 메타탐색엔진의 검색효율성 비교연구)

  • 김성희
    • Journal of Korean Library and Information Science Society
    • /
    • v.27
    • /
    • pp.457-483
    • /
    • 1997
  • This study was intended to compare the effectiveness of the Savvy search and Metacrawler in terms of the total number of relevant documents retrieved, precision, recall, and the number of deadlines. In addition, this study measured whether the Meta-search engine and general web search engines retrieved different web documents. As a result, Savvy search produced a higher precision and recall as compared with motacrawler search engine while the metacrawler had lower deadlines ration than savvy search, Also, Meta search engine was more effective than the general web search engine, The results show that the hybrid methodology of integrating a variety of web search engines can help solve retrieval effectiveness problems on the Internet.

  • PDF

A new hybrid optimization algorithm based on path projection

  • Gharebaghi, Saeed Asil;Ardalan Asl, Mohammad
    • Structural Engineering and Mechanics
    • /
    • v.65 no.6
    • /
    • pp.707-719
    • /
    • 2018
  • In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

The Effectiveness of the Invisible Web Search Tools (Invisible Web 탐색도구의 성능 비교 및 분석)

  • Ro, Jung-Soon
    • Journal of the Korean Society for information Management
    • /
    • v.21 no.3
    • /
    • pp.203-225
    • /
    • 2004
  • This study is to investigate the characteristics of the Invisible Web and many search services designed to serve as gateways to the Invisible Web and to evaluate searching the Invisible Web in the Services. The four services for searching the Invisible Web were selected to search the Invisible Web with 11 queries, that are Google as portals, ProFusion and Search.com as Invisible Web meta search engines, and IncyWincy as Invisible Web search engines. It was found that the effectiveness of Google's Invisible Web searching was better compared with the three Invisible Web search tools but the difference between the four systems was not significant((${\alpha}$=.055) The Invisible Web meta searching was better than the Web meta searching in the three search tools at the statistically significant level. The effectiveness measurement based on the ranks and relevance degree(quality) of relevant documents retrieved seemed appropriate to the ranked search results.

MetaSearch for Entry Page Finding Task (엔트리 페이지 검색을 위한 메타 검색)

  • Kang In-Ho
    • The KIPS Transactions:PartB
    • /
    • v.12B no.2 s.98
    • /
    • pp.215-222
    • /
    • 2005
  • In this paper, a MetaSearch algorithm for navigational queries is presented. Previous MetaSearch algorithms focused on informational queries. They Eave a high score to an overlapped document. However, the overemphasis of overlapped documents may degrade the performance of a MetaSearch algerian for a navigational query. However, if a lot of result documents are from a certain domain or a directory, then we can assume the importance of the domain or directory. Various experiments are conducted to show the effectiveness of overlap of a domain and directory names. System results from TREC and commercial search engines are used for experiments. From the results of experiments, the overlap of documents showed the better performance for informational queries. However, the overlap of domain names and directory names showed the $10\%$ higher performance for navigational queries.

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.

An Iterative Insertion Algorithm and a Hybrid Meta Heuristic for the Traveling Salesman Problem with Time Windows (시간제약이 있는 외판원 문제를 위한 메타휴리스틱 기법)

  • Kim, Byung-In
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.1
    • /
    • pp.86-98
    • /
    • 2007
  • This paper presents a heuristic algorithm for the traveling salesman problem with time windows (TSPTW). Aniterative insertion algorithm as a constructive search heuristic and a hybrid meta heuristic combining simulatedannealing and tabu search with the randomized selection of 2-interchange and a simple move operator as animproving search heuristic are proposed, Computational tests performed on 400 benchmark problem instancesshow that the proposed algorithm generates optimal or near-optimal solutions in most cases. New best knownheuristic values for many benchmark problem sets were obtained using the proposed approach.