IDEAS home Printed from https://ideas.repec.org/a/aes/infoec/vxiiy2008i2p5-11.html
   My bibliography  Save this article

World Wide Web Metasearch Clustering Algorithm

Author

Listed:
  • Adina LIPAI

Abstract

As the storage capacity and the processing speed of search engine is growing to keep up with the constant expansion of the World Wide Web, the user is facing an increasing list of results for a given query. A simple query composed of common words sometimes have hundreds even thousands of results making it practically impossible for the user to verify all of them, in order to identify a particular site. Even when the list of results is presented to the user ordered by a rank, most of the time it is not sufficient support to help him identify the most relevant sites for his query. The concept of search result clustering was introduced as a solution to this situation. The process of clustering search results consists of building up thematically homogenous groups from the initial list results provided by classic search tools, and using up characteristics present within the initial results, without any kind of predefined categories.

Suggested Citation

  • Adina LIPAI, 2008. "World Wide Web Metasearch Clustering Algorithm," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 0(2), pages 5-11.
    • Handle: RePEc:aes:infoec:v:xii:y:2008:i:2:p:5-11
    as

    Download full text from publisher

    File URL: http://revistaie.ase.ro/content/46/Adina%20Lipai.pdf
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Eugen Gabriel GARAIS, 2015. "An Analytical Point Of View About Maintenance Processes For Distributed Applications," Romanian Economic Business Review, Romanian-American University, vol. 9(1), pages 232-240, May.
    2. Gabriel Eugen Garais, 2012. "Maintenance Processes Evaluation For Distributed Applications," Romanian Economic Business Review, Romanian-American University, vol. 6(2), pages 378-388, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:aes:infoec:v:xii:y:2008:i:2:p:5-11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Paul Pocatilu (email available below). General contact details of provider: https://edirc.repec.org/data/aseeero.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.