Sciweavers

2497 search results - page 49 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
ICDE
2007
IEEE
133views Database» more  ICDE 2007»
15 years 11 months ago
Programming Patterns for Architecture-Level Software Optimizations on Frequent Pattern Mining
One very important application in the data mining domain is frequent pattern mining. Various authors have worked on improving the efficiency of this computation, mostly focusing o...
Mingliang Wei, Changhao Jiang, Marc Snir
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
ICDM
2007
IEEE
199views Data Mining» more  ICDM 2007»
15 years 4 months ago
Discovering Structural Anomalies in Graph-Based Data
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
William Eberle, Lawrence B. Holder
ADMA
2006
Springer
149views Data Mining» more  ADMA 2006»
15 years 3 months ago
An Interactive Visualization Environment for Data Exploration Using Points of Interest
We present in this paper an interactive method for numeric or symbolic data visualization that allows a domain expert to extract useful knowledge and information. We propose a new ...
David Da Costa, Gilles Venturini
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
15 years 10 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà