Sciweavers

4085 search results - page 62 / 817
» Benchmarking Data Mining Algorithms
Sort
View
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
14 years 1 months ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 8 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 7 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
SDM
2003
SIAM
174views Data Mining» more  SDM 2003»
13 years 9 months ago
STAMP: On Discovery of Statistically Important Pattern Repeats in Long Sequential Data
In this paper, we focus on mining periodic patterns allowing some degree of imperfection in the form of random replacement from a perfect periodic pattern. In InfoMiner+, we propo...
Jiong Yang, Wei Wang 0010, Philip S. Yu
ICDM
2006
IEEE
86views Data Mining» more  ICDM 2006»
14 years 1 months ago
Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description
The ultimate goal of data mining is to extract knowledge from massive data. Knowledge is ideally represented as human-comprehensible patterns from which end-users can gain intuiti...
Byron J. Gao, Martin Ester