Sciweavers

7150 search results - page 637 / 1430
» Graph-Based Data Mining
Sort
View
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
16 years 25 days 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
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
16 years 17 days ago
Towards Optimizing Conjunctive Inductive Queries
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
Johannes Fischer, Luc De Raedt
DEXA
2003
Springer
193views Database» more  DEXA 2003»
16 years 13 days 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
KDD
2010
ACM
233views Data Mining» more  KDD 2010»
15 years 11 months ago
Evolutionary hierarchical dirichlet processes for multiple correlated time-varying corpora
Mining cluster evolution from multiple correlated time-varying text corpora is important in exploratory text analytics. In this paper, we propose an approach called evolutionary h...
Jianwen Zhang, Yangqiu Song, Changshui Zhang, Shix...
DAWAK
2006
Springer
15 years 11 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...