Sciweavers

553 search results - page 42 / 111
» A Compress-Based Association Mining Algorithm for Large Data...
Sort
View
DAWAK
2010
Springer
14 years 11 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
KDD
2012
ACM
226views Data Mining» more  KDD 2012»
13 years 9 days ago
TourViz: interactive visualization of connection pathways in large graphs
We present TOURVIZ, a system that helps its users to interactively visualize and make sense in large network datasets. In particular, it takes as input a set of nodes the user spe...
Duen Horng Chau, Leman Akoglu, Jilles Vreeken, Han...
AUSDM
2006
Springer
94views Data Mining» more  AUSDM 2006»
15 years 1 months ago
Marking Time in Sequence Mining
Sequence mining is often conducted over static and temporal datasets as well as over collections of events (episodes). More recently, there has also been a focus on the mining of ...
Carl Mooney, John F. Roddick
ICDM
2009
IEEE
141views Data Mining» more  ICDM 2009»
15 years 4 months ago
Scalable Algorithms for Distribution Search
Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data m...
Yasuko Matsubara, Yasushi Sakurai, Masatoshi Yoshi...
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
14 years 11 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen