Sciweavers

1132 search results - page 58 / 227
» Similarity Graphs
Sort
View
AAAI
2008
14 years 1 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
TMM
2010
199views Management» more  TMM 2010»
13 years 5 months ago
Video Annotation Through Search and Graph Reinforcement Mining
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...
Emily Moxley, Tao Mei, Bangalore S. Manjunath
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
14 years 5 months ago
ORIGAMI: Mining Representative Orthogonal Graph Patterns
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, J&e...
SADM
2008
90views more  SADM 2008»
13 years 10 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...
ICCS
2010
Springer
13 years 9 months ago
Translations between RDF(S) and Conceptual Graphs
Though similarities between the Semantic Web language RDF(S) and languages of the Conceptual Graphs family have often been pointed out, the differences between these formalisms hav...
Jean-François Baget, Madalina Croitoru, Ala...