Sciweavers

216 search results - page 19 / 44
» Using a Hash-Based Method for Apriori-Based Graph Mining
Sort
View
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 9 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 9 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
CIKM
2009
Springer
14 years 3 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
14 years 2 months ago
Mining breast cancer data with XCS
In this paper, we describe the use of a modern learning classifier system to a data mining task. In particular, in collaboration with a medical specialist, we apply XCS to a prima...
Faten Kharbat, Larry Bull, Mohammed Odeh
KDD
2010
ACM
327views Data Mining» more  KDD 2010»
14 years 15 days ago
Cold start link prediction
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
Vincent Leroy, Berkant Barla Cambazoglu, Francesco...