Sciweavers

618 search results - page 26 / 124
» Aggregated Subset Mining
Sort
View
ICDM
2009
IEEE
108views Data Mining» more  ICDM 2009»
14 years 3 months ago
RING: An Integrated Method for Frequent Representative Subgraph Mining
—We propose a novel representative based subgraph mining model. A series of standards and methods are proposed to select invariants. Patterns are mapped into invariant vectors in...
Shijie Zhang, Jiong Yang, Shirong Li
KDD
1997
ACM
96views Data Mining» more  KDD 1997»
14 years 20 days ago
Mining Association Rules with Item Constraints
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice...
Ramakrishnan Srikant, Quoc Vu, Rakesh Agrawal
JDWM
2010
139views more  JDWM 2010»
13 years 7 months ago
Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
Panagiotis Giannikopoulos, Iraklis Varlamis, Magda...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 9 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 11 months ago
Sampling minimal frequent boolean (DNF) patterns
We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class ...
Geng Li, Mohammed J. Zaki