Sciweavers

1768 search results - page 76 / 354
» Mining Very Large Databases
Sort
View
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 10 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 10 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
IEAAIE
2009
Springer
14 years 4 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
RIDE
1997
IEEE
14 years 2 months ago
Evaluation of Sampling for Data Mining of Association Rules
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 4 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche