Sciweavers

731 search results - page 124 / 147
» Taxonomy-superimposed graph mining
Sort
View
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
14 years 9 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
WWW
2010
ACM
14 years 2 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
ACCV
2009
Springer
14 years 2 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
ECCV
2010
Springer
14 years 5 days ago
From a Set of Shapes to Object Discovery
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
CIKM
2008
Springer
13 years 9 months ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church