Sciweavers

192 search results - page 33 / 39
» Efficient Mining of Dissociation Rules
Sort
View
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 11 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ç...
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
14 years 8 months ago
Frequent term-based text clustering
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
Florian Beil, Martin Ester, Xiaowei Xu
JIIS
2000
111views more  JIIS 2000»
13 years 7 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 7 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
WWW
2007
ACM
14 years 8 months ago
Mirror site maintenance based on evolution associations of web directories
Mirroring Web sites is a well-known technique commonly used in the Web community. A mirror site should be updated frequently to ensure that it reflects the content of the original...
Ling Chen 0002, Sourav S. Bhowmick, Wolfgang Nejdl