Sciweavers

2497 search results - page 74 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
15 years 10 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
77
Voted
ICDM
2005
IEEE
166views Data Mining» more  ICDM 2005»
15 years 3 months ago
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
Ruoming Jin, Gagan Agrawal
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
15 years 3 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...
CAISE
2005
Springer
15 years 3 months ago
A Meta Model for Process Mining Data
Abstract. Modern process-aware information systems store detailed information about processes as they are being executed. This kind of information can be used for very different p...
Boudewijn F. van Dongen, Wil M. P. van der Aalst
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
15 years 10 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang