Sciweavers

216 search results - page 17 / 44
» Compression-based data mining of sequential data
Sort
View
DEXA
2005
Springer
160views Database» more  DEXA 2005»
14 years 2 months ago
Improved Sequential Pattern Mining Using an Extended Bitmap Representation
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
Chien-Liang Wu, Jia-Ling Koh, Pao-Ying An
ICDM
2009
IEEE
130views Data Mining» more  ICDM 2009»
13 years 6 months ago
Efficient Anonymizations with Enhanced Utility
The k-anonymization method is a commonly used privacy-preserving technique. Previous studies used various measures of utility that aim at enhancing the correlation between the orig...
Jacob Goldberger, Tamir Tassa
KDD
2006
ACM
166views Data Mining» more  KDD 2006»
14 years 9 months ago
Anonymizing sequential releases
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
Ke Wang, Benjamin C. M. Fung
ML
2006
ACM
148views Machine Learning» more  ML 2006»
13 years 8 months ago
Melodic analysis with segment classes
This paper presents a representation for melodic segment classes and applies it to music data mining. Melody is modeled as a sequence of segments, each segment being a sequenceofno...
Darrell Conklin
JIIS
2007
150views more  JIIS 2007»
13 years 8 months ago
Towards a new approach for mining frequent itemsets on data stream
Mining frequent patterns on streaming data is a new challenging problem for the data mining community since data arrives sequentially in the form of continuous rapid streams. In t...
Chedy Raïssi, Pascal Poncelet, Maguelonne Tei...