Sciweavers

2227 search results - page 106 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
100
Voted
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 10 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
EMNLP
2007
15 years 2 months ago
Incremental Generation of Plural Descriptions: Similarity and Partitioning
Approaches to plural reference generation emphasise descriptive brevity, but often lack empirical backing. This paper describes a corpus-based study of plural descriptions, and pr...
Albert Gatt, Kees van Deemter
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 1 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
CIVR
2005
Springer
133views Image Analysis» more  CIVR 2005»
15 years 6 months ago
Hot Event Detection and Summarization by Graph Modeling and Matching
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
Yuxin Peng, Chong-Wah Ngo
109
Voted
COMAD
2008
15 years 2 months ago
Disk-Based Sampling for Outlier Detection in High Dimensional Data
We propose an efficient sampling based outlier detection method for large high-dimensional data. Our method consists of two phases. In the first phase, we combine a "sampling...
Timothy de Vries, Sanjay Chawla, Pei Sun, Gia Vinh...