Sciweavers

1976 search results - page 330 / 396
» Predictive Graph Mining
Sort
View
MST
2007
154views more  MST 2007»
13 years 8 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
SAC
2008
ACM
13 years 8 months ago
Selectivity estimation in spatial networks
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
AAAI
2011
12 years 8 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 4 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
ICPR
2006
IEEE
14 years 10 months ago
A Semi-supervised SVM for Manifold Learning
Many classification tasks benefit from integrating manifold learning and semi-supervised learning. By formulating the learning task in a semi-supervised manner, we propose a novel...
Zhili Wu, Chun-hung Li, Ji Zhu, Jian Huang