Sciweavers

165 search results - page 22 / 33
» Mining Compressed Frequent-Pattern Sets
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 9 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 5 months ago
Analysing the behaviour of robot teams through relational sequential pattern mining
This report outlines the use of a relational representation in a Multi-Agent domain to model the behaviour of the whole system. A desired property in this systems is the ability of...
Grazia Bombini, Raquel Ros, Stefano Ferilli, Ramon...
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
14 years 6 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
APPINF
2003
13 years 10 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
SIGMOD
2004
ACM
209views Database» more  SIGMOD 2004»
14 years 9 months ago
MAIDS: Mining Alarming Incidents from Data Streams
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
Y. Dora Cai, David Clutter, Greg Pape, Jiawei Han,...