Sciweavers

110 search results - page 8 / 22
» kdd 2005
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 10 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
14 years 10 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
14 years 10 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek
KDD
2005
ACM
151views Data Mining» more  KDD 2005»
14 years 10 months ago
Discovering evolutionary theme patterns from text: an exploration of temporal text mining
Temporal Text Mining (TTM) is concerned with discovering temporal patterns in text information collected over time. Since most text information bears some time stamps, TTM has man...
Qiaozhu Mei, ChengXiang Zhai
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
14 years 10 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin