Sciweavers

1913 search results - page 135 / 383
» Using Data Mining in MURA Graphic Problems
Sort
View
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
16 years 4 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 4 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
SDM
2007
SIAM
152views Data Mining» more  SDM 2007»
15 years 5 months ago
HP2PC: Scalable Hierarchically-Distributed Peer-to-Peer Clustering
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...
Khaled M. Hammouda, Mohamed S. Kamel
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
16 years 4 months ago
Discovering significant rules
In many applications, association rules will only be interesting if they represent non-trivial correlations between all constituent items. Numerous techniques have been developed ...
Geoffrey I. Webb
KDD
2010
ACM
161views Data Mining» more  KDD 2010»
15 years 5 months ago
Mass estimation and its applications
This paper introduces mass estimation—a base modelling mechanism in data mining. It provides the theoretical basis of mass and an efficient method to estimate mass. We show that...
Kai Ming Ting, Guang-Tong Zhou, Fei Tony Liu, Jame...