Multidimensional mining of search logs based on topic-concept cube approach주제-개념 큐브 접근법에 기반한 검색 로그의 다차원 마이닝

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 440
  • Download : 0
In addition to search queries and the corresponding click-through information, search engine logs record multidimensional information about user search activities, such as search time, location, vertical, and search device. Multidimensional mining of search logs can provide novel insights and useful knowledge for both search engine users and developers. How can we develop a search engine service to support multidimensional mining of search logs effectively and efficiently? In this paper, we describe our topic-concept cube project which addresses the business need and answers several challenges. First, to semantically summarize a set of search queries and click-through data, we develop a novel topic-concept model which learns a hierarchy of concepts and topics automatically from search logs. Second, to handle a huge amount of log data, we develop distributed algorithms for learning model parameters efficiently. Third, we present alternative approaches for computing a topic-concept cube which supports multidimensional mining of search log data online. Last, we report an empirical study verifying the effectiveness and efficiency of our approach on a real data set of 1.96 billion queries and 2.73 billion clicks.
Advisors
Choi, Ho-Jinresearcher최호진researcher
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2010
Identifier
455254/325007  / 020074340
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 2010.08, [ v, 31 p. ]

Keywords

data mining; data cube; 데이터 큐브; 데이터마이닝

URI
http://hdl.handle.net/10203/34945
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=455254&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0