%0 Journal Article %1 Chen2008 %A Chen, Ling %A Hu, Yiqun %A Nejdl, Wolfgang %D 2008 %I IEEE %J IEEE International Conference on Data Mining %K erc event_detection imported %P 123--132 %R 10.1109/ICDM.2008.78 %T DECK: Detecting Events from Web Click-Through Data %U http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4781107 %X In the past few years, there has been increased research interest in detecting previously unidentified events from Web resources. Our focus in this paper is to detect events from the click-through data generated by Web search engines. Existing event detection algorithms, which mainly study the news archive data, cannot be employed directly because of the following two unique features of click-through data: 1) the information provided by click-through data is quite limited; 2) not every query issued to a Web search engine corresponds to an event in the real world. In this paper, we address this problem by proposing an effective algorithm which Detects Events from ClicK-through data DECK. We firstly transform click-through data to the 2D polar space by considering the semantic dimension and temporal dimension of queries. Robust subspace estimation is performed to detect subspaces such that each subspace consists of queries of similar semantics. Next, we prune uninteresting subspaces which do not contain queries corresponding to real events by simultaneously considering the respective distribution of queries along the semantic dimension and the temporal dimension in each subspace. Finally, events are detected from interesting subspaces using a nonparametric clustering technique. Compared with an existing approach, our experimental results based on real-life data have shown that the proposed approach is more accurate and effective in detecting real events from click-through data. %@ 978-0-7695-3502-9

@article{Chen2008, abstract = {In the past few years, there has been increased research interest in detecting previously unidentified events from Web resources. Our focus in this paper is to detect events from the click-through data generated by Web search engines. Existing event detection algorithms, which mainly study the news archive data, cannot be employed directly because of the following two unique features of click-through data: 1) the information provided by click-through data is quite limited; 2) not every query issued to a Web search engine corresponds to an event in the real world. In this paper, we address this problem by proposing an effective algorithm which Detects Events from ClicK-through data DECK. We firstly transform click-through data to the 2D polar space by considering the semantic dimension and temporal dimension of queries. Robust subspace estimation is performed to detect subspaces such that each subspace consists of queries of similar semantics. Next, we prune uninteresting subspaces which do not contain queries corresponding to real events by simultaneously considering the respective distribution of queries along the semantic dimension and the temporal dimension in each subspace. Finally, events are detected from interesting subspaces using a nonparametric clustering technique. Compared with an existing approach, our experimental results based on real-life data have shown that the proposed approach is more accurate and effective in detecting real events from click-through data.}, added-at = {2012-09-17T17:48:52.000+0200}, author = {Chen, Ling and Hu, Yiqun and Nejdl, Wolfgang}, biburl = {https://www.bibsonomy.org/bibtex/223c9b6c42499358b41ebcf1e732b98b6/lillejul}, doi = {10.1109/ICDM.2008.78}, interhash = {cf94bbcd8dd4e9f69389396e27e47fc1}, intrahash = {23c9b6c42499358b41ebcf1e732b98b6}, isbn = {978-0-7695-3502-9}, journal = {IEEE International Conference on Data Mining}, keywords = {erc event_detection imported}, month = dec, pages = {123--132}, publisher = {IEEE}, timestamp = {2012-09-17T17:54:05.000+0200}, title = {{DECK: Detecting Events from Web Click-Through Data}}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4781107}, year = 2008 }