This paper proposes a subtopic mining method based on three-level hierarchical search intentions. Various subtopic candidates are extracted from web documents using a simple pattern, and higherlevel and lower-level subtopics are selected from these candidates. The selected subtopics as second-level subtopics are ranked by a proposed measure, and are expanded and re-ranked considering the characteristics of resources. Using general terms in the higher-level subtopics, we make second-level subtopic groups and generate first-level subtopics. Our method achieved better performance than a state of the art method.
CITATION STYLE
Kim, S. J., Shin, J., & Lee, J. H. (2016). Subtopic mining based on three-level hierarchical search intentions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9626, pp. 741–747). Springer Verlag. https://doi.org/10.1007/978-3-319-30671-1_62
Mendeley helps you to discover research relevant for your work.