2227 search results - page 106 / 446 » Graph Mining based on a Data Partitioning Approach |
166
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
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 ...
136
click to vote
EMNLP
2007
15 years 7 months ago
2007
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...
185
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
162
click to vote
CIVR
2005
Springer
15 years 12 months ago
2005
Springer
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...
170
click to vote
COMAD
2008
15 years 7 months ago
2008
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...