Sciweavers

7 search results - page 1 / 2
» Fast vertical mining using diffsets
Sort
View
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 5 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda
HICSS
2006
IEEE
138views Biometrics» more  HICSS 2006»
13 years 10 months ago
An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics
Finding frequent patterns from databases has been the most time consuming process in data mining tasks, like association rule mining. Frequent pattern mining in real-time is of in...
Rajanish Dass, Ambuj Mahanti
SIGMOD
2000
ACM
212views Database» more  SIGMOD 2000»
13 years 9 months ago
SQLEM: Fast Clustering in SQL using the EM Algorithm
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...
Carlos Ordonez, Paul Cereghini
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
13 years 10 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
JCP
2008
171views more  JCP 2008»
13 years 4 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen