Sciweavers

4085 search results - page 291 / 817
» Benchmarking Data Mining Algorithms
Sort
View
IDA
2008
Springer
15 years 4 months ago
Mining frequent items in a stream using flexible windows
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
Toon Calders, Nele Dexters, Bart Goethals
TKDE
2008
152views more  TKDE 2008»
15 years 4 months ago
SRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by max...
Deng Cai, Xiaofei He, Jiawei Han
KDD
2001
ACM
169views Data Mining» more  KDD 2001»
16 years 4 months ago
Hierarchical cluster analysis of SAGE data for cancer profiling
In this paper we present a method for clustering SAGE (Serial Analysis of Gene Expression) data to detect similarities and dissimilarities between different types of cancer on the...
Jörg Sander, Monica C. Sleumer, Raymond T. Ng
ICDM
2003
IEEE
125views Data Mining» more  ICDM 2003»
15 years 9 months ago
Clustering Item Data Sets with Association-Taxonomy Similarity
We explore in this paper the efficient clustering of item data. Different from those of the traditional data, the features of item data are known to be of high dimensionality and...
Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
16 years 4 months ago
Generative model-based clustering of directional data
High dimensional directional data is becoming increasingly important in contemporary applications such as analysis of text and gene-expression data. A natural model for multivaria...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...