Sciweavers

969 search results - page 26 / 194
» Generalized matching from theory to application
Sort
View
BMCBI
2007
157views more  BMCBI 2007»
13 years 8 months ago
Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...
Feng Luo, Yunfeng Yang, Jianxin Zhong, Haichun Gao...
WWW
2008
ACM
14 years 8 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
AGILE
2008
Springer
120views GIS» more  AGILE 2008»
14 years 2 months ago
A Study on the Cognitive Plausibility of SIM-DL Similarity Rankings for Geographic Feature Types
The SIM-DL theory has been developed to enable similarity measurement between concept specifications using description logics. It thus closes the gap between similarity theories f...
Krzysztof Janowicz, Carsten Keßler, Ilija Pa...
AIMSA
2010
Springer
13 years 9 months ago
Towards Ontological Blending
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...
Joana Hois, Oliver Kutz, Till Mossakowski, John A....