Sciweavers

112 search results - page 5 / 23
» Neighborhood based fast graph search in large networks
Sort
View
76
Voted
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
15 years 4 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom
DEXAW
1999
IEEE
119views Database» more  DEXAW 1999»
15 years 1 months ago
Structure-Based Similarity Search with Graph Histograms
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
Apostolos Papadopoulos, Yannis Manolopoulos
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
CVPR
2007
IEEE
15 years 11 months ago
A contextual dissimilarity measure for accurate and efficient image search
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
Herve Jegou, Hedi Harzallah, Cordelia Schmid
CVPR
2011
IEEE
14 years 5 months ago
Noise Resistant Graph Ranking for Improved Web Image Search
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
Wei Liu, Yu-Gang Jiang, Jiebo Luo, Shih-Fu Chang