An entropy-based hierarchical search result clustering method by utilizing augmented information

Hung-Yu Kao, Hsin Wei Hsiao, Chih Lu Lin, Chia Chun Shih, Tse Ming Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Because of the improvement of the technology of search engines, and the massively increase of the number of web pages, the results returned by the search engines are always mixed and disordered. Especially for the queries with multiple topics, the mixed and disorderly situation of the search results would be more obvious. The search engines can return information of several hundred to thousand of the pages' titles, snippets and URLs. Almost all of the technologies about search result clustering must attain further information from the contents of the returned lists. However, long execution time is not permitted for a real-time clustering system. In this paper we propose some methods with better efficiency to improve the previous technologies. We utilize and augment information that search engines returned and use entropy calculation to attain the term distribution in snippets. We also propose several new methods to attain better clustered search results and reduce execution time. Our experiments indicate that these proposed methods obtain the better clustered results.

Original languageEnglish
Title of host publicationInformation Retrieval Technology - 4th Asia Information Retrieval Symposium, AIRS 2008, Revised Selected Papers
Pages670-675
Number of pages6
DOIs
Publication statusPublished - 2008 Jun 25
Event4th Asia Information Retrieval Symposium, AIRS 2008 - Harbin, China
Duration: 2008 Jan 152008 Jan 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4993 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Asia Information Retrieval Symposium, AIRS 2008
CountryChina
CityHarbin
Period08-01-1508-01-18

Fingerprint

Search engines
Clustering Methods
Entropy
Search Engine
Websites
Execution Time
Clustering
Query
Real-time
Term
Experiments
Experiment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kao, H-Y., Hsiao, H. W., Lin, C. L., Shih, C. C., & Tsai, T. M. (2008). An entropy-based hierarchical search result clustering method by utilizing augmented information. In Information Retrieval Technology - 4th Asia Information Retrieval Symposium, AIRS 2008, Revised Selected Papers (pp. 670-675). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4993 LNCS). https://doi.org/10.1007/978-3-540-68636-1_81
Kao, Hung-Yu ; Hsiao, Hsin Wei ; Lin, Chih Lu ; Shih, Chia Chun ; Tsai, Tse Ming. / An entropy-based hierarchical search result clustering method by utilizing augmented information. Information Retrieval Technology - 4th Asia Information Retrieval Symposium, AIRS 2008, Revised Selected Papers. 2008. pp. 670-675 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9a71291f4b5240b6be90e0d5bb6f7a93,
title = "An entropy-based hierarchical search result clustering method by utilizing augmented information",
abstract = "Because of the improvement of the technology of search engines, and the massively increase of the number of web pages, the results returned by the search engines are always mixed and disordered. Especially for the queries with multiple topics, the mixed and disorderly situation of the search results would be more obvious. The search engines can return information of several hundred to thousand of the pages' titles, snippets and URLs. Almost all of the technologies about search result clustering must attain further information from the contents of the returned lists. However, long execution time is not permitted for a real-time clustering system. In this paper we propose some methods with better efficiency to improve the previous technologies. We utilize and augment information that search engines returned and use entropy calculation to attain the term distribution in snippets. We also propose several new methods to attain better clustered search results and reduce execution time. Our experiments indicate that these proposed methods obtain the better clustered results.",
author = "Hung-Yu Kao and Hsiao, {Hsin Wei} and Lin, {Chih Lu} and Shih, {Chia Chun} and Tsai, {Tse Ming}",
year = "2008",
month = "6",
day = "25",
doi = "10.1007/978-3-540-68636-1_81",
language = "English",
isbn = "3540686339",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "670--675",
booktitle = "Information Retrieval Technology - 4th Asia Information Retrieval Symposium, AIRS 2008, Revised Selected Papers",

}

Kao, H-Y, Hsiao, HW, Lin, CL, Shih, CC & Tsai, TM 2008, An entropy-based hierarchical search result clustering method by utilizing augmented information. in Information Retrieval Technology - 4th Asia Information Retrieval Symposium, AIRS 2008, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4993 LNCS, pp. 670-675, 4th Asia Information Retrieval Symposium, AIRS 2008, Harbin, China, 08-01-15. https://doi.org/10.1007/978-3-540-68636-1_81

An entropy-based hierarchical search result clustering method by utilizing augmented information. / Kao, Hung-Yu; Hsiao, Hsin Wei; Lin, Chih Lu; Shih, Chia Chun; Tsai, Tse Ming.

Information Retrieval Technology - 4th Asia Information Retrieval Symposium, AIRS 2008, Revised Selected Papers. 2008. p. 670-675 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4993 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An entropy-based hierarchical search result clustering method by utilizing augmented information

AU - Kao, Hung-Yu

AU - Hsiao, Hsin Wei

AU - Lin, Chih Lu

AU - Shih, Chia Chun

AU - Tsai, Tse Ming

PY - 2008/6/25

Y1 - 2008/6/25

N2 - Because of the improvement of the technology of search engines, and the massively increase of the number of web pages, the results returned by the search engines are always mixed and disordered. Especially for the queries with multiple topics, the mixed and disorderly situation of the search results would be more obvious. The search engines can return information of several hundred to thousand of the pages' titles, snippets and URLs. Almost all of the technologies about search result clustering must attain further information from the contents of the returned lists. However, long execution time is not permitted for a real-time clustering system. In this paper we propose some methods with better efficiency to improve the previous technologies. We utilize and augment information that search engines returned and use entropy calculation to attain the term distribution in snippets. We also propose several new methods to attain better clustered search results and reduce execution time. Our experiments indicate that these proposed methods obtain the better clustered results.

AB - Because of the improvement of the technology of search engines, and the massively increase of the number of web pages, the results returned by the search engines are always mixed and disordered. Especially for the queries with multiple topics, the mixed and disorderly situation of the search results would be more obvious. The search engines can return information of several hundred to thousand of the pages' titles, snippets and URLs. Almost all of the technologies about search result clustering must attain further information from the contents of the returned lists. However, long execution time is not permitted for a real-time clustering system. In this paper we propose some methods with better efficiency to improve the previous technologies. We utilize and augment information that search engines returned and use entropy calculation to attain the term distribution in snippets. We also propose several new methods to attain better clustered search results and reduce execution time. Our experiments indicate that these proposed methods obtain the better clustered results.

UR - http://www.scopus.com/inward/record.url?scp=45449112770&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45449112770&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-68636-1_81

DO - 10.1007/978-3-540-68636-1_81

M3 - Conference contribution

SN - 3540686339

SN - 9783540686330

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 670

EP - 675

BT - Information Retrieval Technology - 4th Asia Information Retrieval Symposium, AIRS 2008, Revised Selected Papers

ER -

Kao H-Y, Hsiao HW, Lin CL, Shih CC, Tsai TM. An entropy-based hierarchical search result clustering method by utilizing augmented information. In Information Retrieval Technology - 4th Asia Information Retrieval Symposium, AIRS 2008, Revised Selected Papers. 2008. p. 670-675. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-68636-1_81