Sciweavers

41 search results - page 5 / 9
» Language Identification With Confidence Limits
Sort
View
PAMI
1998
87views more  PAMI 1998»
13 years 8 months ago
Learning Local Languages and Their Application to DNA Sequence Analysis
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
Takashi Yokomori, Satoshi Kobayashi
BMCBI
2006
84views more  BMCBI 2006»
13 years 8 months ago
Inferring topology from clustering coefficients in protein-protein interaction networks
Background: Although protein-protein interaction networks determined with high-throughput methods are incomplete, they are commonly used to infer the topology of the complete inte...
Caroline C. Friedel, Ralf Zimmer
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 8 months ago
Rational stochastic languages
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
François Denis, Yann Esposito
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 9 months ago
Stochastic processes and temporal data mining
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...
Paul Cotofrei, Kilian Stoffel
ICASSP
2009
IEEE
14 years 3 months ago
Robust modeling of musical chord sequences using probabilistic N-grams
The modeling of music as a language is a core issue for a wide range of applications such as polyphonic music retrieval, automatic style identification, audio to symbolic music tr...
Ricardo Scholz, Emmanuel Vincent, Fréd&eacu...