Sciweavers

588 search results - page 89 / 118
» Discovering data quality rules
Sort
View
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
14 years 8 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...
ATAL
2005
Springer
14 years 1 months ago
Implicit: an agent-based recommendation system for web search
The number of web pages available on Internet increases day after day, and consequently finding relevant information becomes more and more a hard task. However, when we consider ...
Aliaksandr Birukou, Enrico Blanzieri, Paolo Giorgi...
DAIS
2006
13 years 9 months ago
On the Value of Random Opinions in Decentralized Recommendation
Abstract. As the amount of information available to users continues to grow, filtering wanted items from unwanted ones becomes a dominant task. To this end, various collaborative-f...
Elth Ogston, Arno Bakker, Maarten van Steen
SIGIR
2002
ACM
13 years 7 months ago
Document clustering with committees
Document clustering is useful in many information retrieval tasks: document browsing, organization and viewing of retrieval results, generation of Yahoo-like hierarchies of docume...
Patrick Pantel, Dekang Lin
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 4 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu