Sciweavers

478 search results - page 94 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
WWW
2006
ACM
14 years 10 months ago
Constructing virtual documents for ontology matching
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in t...
Yuzhong Qu, Wei Hu, Gong Cheng
BMCBI
2010
120views more  BMCBI 2010»
13 years 9 months ago
Examination of the relationship between essential genes in PPI network and hub proteins in reverse nearest neighbor topology
Background: In many protein-protein interaction (PPI) networks, densely connected hub proteins are more likely to be essential proteins. This is referred to as the "centralit...
Kang Ning, Hoong Kee Ng, Sriganesh Srihari, Hon Wa...
JCB
2002
160views more  JCB 2002»
13 years 9 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
CSMR
2010
IEEE
13 years 4 months ago
Does the Past Say It All? Using History to Predict Change Sets in a CMDB
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
Sarah Nadi, Richard C. Holt, Serge Mankovski
PR
2011
13 years 4 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...