Sciweavers

7150 search results - page 1117 / 1430
» Graph-Based Data Mining
Sort
View
PAKDD
2011
ACM
473views Data Mining» more  PAKDD 2011»
13 years 3 months ago
 Finding Rare Classes: Adapting Generative and Discriminative Models in Active Learning
Discovering rare categories and classifying new instances of them is an important data mining issue in many fields, but fully supervised learning of a rare class classifier is pr...
Timothy Hospedales, Shaogang Gong and Tao Xiang
PAKDD
2011
ACM
253views Data Mining» more  PAKDD 2011»
13 years 16 days ago
Balance Support Vector Machines Locally Using the Structural Similarity Kernel
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
Jianxin Wu
PAKDD
2011
ACM
214views Data Mining» more  PAKDD 2011»
13 years 16 days ago
Spectral Analysis of k-Balanced Signed Graphs
Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...
Leting Wu, Xiaowei Ying, Xintao Wu, Aidong Lu, Zhi...
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
13 years 16 days ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
13 years 15 days ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
« Prev « First page 1117 / 1430 Last » Next »