Sciweavers

478 search results - page 27 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Instance-Based Prediction with Guaranteed Confidence
Instance-based learning (IBL) algorithms have proved to be successful in many applications. However, as opposed to standard statistical methods, a prediction in IBL is usually give...
Eyke Hüllermeier
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 7 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
BMCBI
2010
178views more  BMCBI 2010»
13 years 9 months ago
An improved method for scoring protein-protein interactions using semantic similarity within the Gene Ontology
Background: Semantic similarity measures are useful to assess the physiological relevance of protein-protein interactions (PPIs). They quantify similarity between proteins based o...
Shobhit Jain, Gary D. Bader
LPAR
2004
Springer
14 years 3 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
FOCS
2003
IEEE
14 years 2 months ago
Clustering with Qualitative Information
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
Moses Charikar, Venkatesan Guruswami, Anthony Wirt...