Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

CIKM
2006
Springer

favoriteEmaildiscussreport

81views Information Technology» more CIKM 2006»

Efficient mining of max frequent patterns in a generalized environment

13 years 8 months ago

Efficient mining of max frequent patterns in a generalized environment

Download www.ccs.neu.edu

This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment. Categories and Subject Descriptors: H.m Information Systems: Miscellaneous General Terms: Algorithms.

Daniel Kunkle, Donghui Zhang, Gene Cooperman

Real-time Traffic

CIKM 2006 | Frequent Generalized Itemsets | Frequent Patterns | Generalized Environment | Information Management |

claim paper

Related Content

» Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy

» An Efficient Heuristic Search for RealTime Frequent Pattern Mining

» Programming Patterns for ArchitectureLevel Software Optimizations on Frequent Pattern Mini...

» Efficient mining of frequent sequence generators

» Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies

» Time and Space Efficient Discovery of Maximal Geometric Graphs

» Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers

» Mining frequent geographic patterns with knowledge constraints

» Outofcore frequent pattern mining on a commodity PC

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CIKM
Authors	Daniel Kunkle, Donghui Zhang, Gene Cooperman

Comments (0)