Sciweavers

5 search results - page 1 / 1
» Query Graphs with Cuts: Mathematical Foundations
Sort
View
DIAGRAMS
2004
Springer
13 years 10 months ago
Query Graphs with Cuts: Mathematical Foundations
Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with...
Frithjof Dau
AI
2010
Springer
13 years 5 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
PR
2008
169views more  PR 2008»
13 years 4 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
13 years 11 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
SIGIR
2005
ACM
13 years 10 months ago
SimFusion: measuring similarity using unified relationship matrix
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
Wensi Xi, Edward A. Fox, Weiguo Fan, Benyu Zhang, ...