Sciweavers

708 search results - page 53 / 142
» Improving Mining Quality by Exploiting Data Dependency
Sort
View
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 7 days ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
15 years 5 months ago
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
Eamonn J. Keogh, Jessica Lin, Ada Wai-Chee Fu
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 5 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
ICWE
2009
Springer
14 years 9 months ago
Fine-Grained Analysis of Web Tasks through Data Visualization
Abstract. This paper presents an approach for monitoring several important aspects related to user behaviour during the execution of Web tasks1 . The approach includes the tracking...
Gennaro Costagliola, Vittorio Fuccella
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
16 years 11 days ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson