Sciweavers

175 search results - page 14 / 35
» Top-Down Mining of Interesting Patterns from Very High Dimen...
Sort
View
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 7 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
ACSW
2004
14 years 11 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
GFKL
2004
Springer
137views Data Mining» more  GFKL 2004»
15 years 3 months ago
Density Estimation and Visualization for Data Containing Clusters of Unknown Structure
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
Alfred Ultsch
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
15 years 2 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 3 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...