Sciweavers

1127 search results - page 52 / 226
» Testing the Expansion of a Graph
Sort
View
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 11 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
PKDD
2000
Springer
151views Data Mining» more  PKDD 2000»
15 years 1 months ago
Discovery of Characteristic subgraph Patterns Using Relative Indexing and the Cascade Model
: Relational representation of objects using graphs reveals much information that cannot be obtained by attribute value representations alone. There are already many databases that...
Takashi Okada, Mayumi Oyama
SODA
2010
ACM
142views Algorithms» more  SODA 2010»
14 years 8 months ago
Speeding up random walks with neighborhood exploration
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
Petra Berenbrink, Colin Cooper, Robert Elsaesser, ...
CVPR
2008
IEEE
15 years 11 months ago
Reduce, reuse & recycle: Efficiently solving multi-label MRFs
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
SIGIR
2009
ACM
15 years 4 months ago
Query dependent pseudo-relevance feedback based on wikipedia
Pseudo-relevance feedback (PRF) via query-expansion has been proven to be effective in many information retrieval (IR) tasks. In most existing work, the top-ranked documents from...
Yang Xu, Gareth J. F. Jones, Bin Wang