Sciweavers

259 search results - page 41 / 52
» Towards parameter-free data mining
Sort
View
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...
OTM
2007
Springer
14 years 1 months ago
Discovering Executable Semantic Mappings Between Ontologies
Creating executable semantic mappings is an important task for ontology-based information integration. Although it is argued that mapping tools may require interaction from humans ...
Han Qin, Dejing Dou, Paea LePendu
CLIMA
2004
13 years 9 months ago
The Apriori Stochastic Dependency Detection (ASDD) Algorithm for Learning Stochastic Logic Rules
Apriori Stochastic Dependency Detection (ASDD) is an algorithm for fast induction of stochastic logic rules from a database of observations made by an agent situated in an environm...
Christopher Child, Kostas Stathis
PETRA
2009
ACM
14 years 2 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
SIGMOD
2004
ACM
100views Database» more  SIGMOD 2004»
14 years 7 months ago
Cost-Based Labeling of Groups of Mass Spectra
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
Lei Chen 0003, Zheng Huang, Raghu Ramakrishnan