Sciweavers

164 search results - page 10 / 33
» Clustering Rules Using Empirical Similarity of Support Sets
Sort
View
CINQ
2004
Springer
116views Database» more  CINQ 2004»
15 years 1 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
85
Voted
ICCS
2009
Springer
15 years 4 months ago
Frequent Itemset Mining for Clustering Near Duplicate Web Documents
A vast amount of documents in the Web have duplicates, which is a challenge for developing efficient methods that would compute clusters of similar documents. In this paper we use ...
Dmitry I. Ignatov, Sergei O. Kuznetsov
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 2 months ago
High Performance Data Mining Using the Nearest Neighbor Join
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 that the r...
Christian Böhm, Florian Krebs
PAMI
2011
14 years 4 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
ADVIS
2004
Springer
15 years 2 months ago
Incremental Association Rule Mining Using Materialized Data Mining Views
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not...
Mikolaj Morzy, Tadeusz Morzy, Zbyszko Króli...