Sciweavers

449 search results - page 74 / 90
» Latent Structure Pattern Mining
Sort
View
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 8 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
ICUIMC
2009
ACM
14 years 1 months ago
PicAChoo: a tool for customizable feature extraction utilizing characteristics of textual data
Although documents have hundreds of thousands of unique words, only a small number of words are significantly useful for intelligent services. For this reason, feature extraction ...
Jaeseok Myung, Jung-Yeon Yang, Sang-goo Lee
SIGMOD
1999
ACM
112views Database» more  SIGMOD 1999»
13 years 11 months ago
A New Method for Similarity Indexing of Market Basket Data
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
TODS
2002
92views more  TODS 2002»
13 years 7 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
KDD
2006
ACM
222views Data Mining» more  KDD 2006»
14 years 7 months ago
A component-based framework for knowledge discovery in bioinformatics
Motivation: In the field of bioinformatics there is an emerging need to integrate all knowledge discovery steps into a standardized modular framework. Indeed, component-based deve...
Julien Etienne, Bernd Wachmann, Lei Zhang