Sciweavers

47 search results - page 4 / 10
» A graph method for keyword-based selection of the top-K data...
Sort
View
CIKM
2009
Springer
13 years 11 months ago
Graph classification based on pattern co-occurrence
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
Ning Jin, Calvin Young, Wei Wang
WWW
2010
ACM
14 years 5 days ago
SourceRank: relevance and trust assessment for deep web sources based on inter-source agreement
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
Raju Balakrishnan, Subbarao Kambhampati
IDA
2010
Springer
13 years 3 months ago
Selecting the Links in BisoNets Generated from Document Collections
According to Koestler, the notion of a bisociation denotes a connection between pieces of information from habitually separated domains or categories. In this paper, we consider a ...
Marc Segond, Christian Borgelt
CIKM
2009
Springer
13 years 11 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 7 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu