Sciweavers

8 search results - page 1 / 2
» Mining Approximate Order Preserving Clusters in the Presence...
Sort
View
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 6 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
SDM
2007
SIAM
118views Data Mining» more  SDM 2007»
13 years 6 months ago
On Privacy-Preservation of Text and Sparse Binary Data with Sketches
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high...
Charu C. Aggarwal, Philip S. Yu
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 5 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
BPM
2009
Springer
175views Business» more  BPM 2009»
13 years 11 months ago
Understanding Spaghetti Models with Sequence Clustering for ProM
The goal of process mining is to discover process models from event logs. However, for processes that are not well structured and have a lot of diverse behavior, existing process m...
Gabriel M. Veiga, Diogo R. Ferreira
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
14 years 6 months ago
A Framework for Clustering Uncertain Data Streams
Abstract-- In recent years, uncertain data management applications have grown in importance because of the large number of hardware applications which measure data approximately. F...
Charu C. Aggarwal, Philip S. Yu