Sciweavers

1552 search results - page 76 / 311
» Mining for Patterns in Contradictory Data
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
16 years 4 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à
ESWA
2007
178views more  ESWA 2007»
15 years 3 months ago
Educational data mining: A survey from 1995 to 2005
ct 7 Currently there is an increasing interest in data mining and educational systems, making educational data mining as a new growing 8 research community. This paper surveys the ...
Cristóbal Romero, Sebastián Ventura
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
15 years 9 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
VLDB
2005
ACM
180views Database» more  VLDB 2005»
15 years 9 months ago
Cache-conscious Frequent Pattern Mining on a Modern Processor
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasa...
CIKM
2009
Springer
15 years 7 months ago
Mining data streams with periodically changing distributions
Dynamic data streams are those whose underlying distribution changes over time. They occur in a number of application domains, and mining them is important for these applications....
Yingying Tao, M. Tamer Özsu