Sciweavers

1976 search results - page 231 / 396
» Predictive Graph Mining
Sort
View
KAIS
2011
129views more  KAIS 2011»
13 years 5 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 7 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 10 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
SDM
2008
SIAM
144views Data Mining» more  SDM 2008»
13 years 11 months ago
Semi-supervised Multi-label Learning by Solving a Sylvester Equation
Multi-label learning refers to the problems where an instance can be assigned to more than one category. In this paper, we present a novel Semi-supervised algorithm for Multi-labe...
Gang Chen, Yangqiu Song, Fei Wang, Changshui Zhang
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 10 months ago
Robust boosting and its relation to bagging
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
Saharon Rosset