Sciweavers

18 search results - page 2 / 4
» Dagma: Mining Directed Acyclic Graphs
Sort
View
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
14 years 2 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 12 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
14 years 3 months ago
Mining Genes in DNA Using GeneScout
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
Michael M. Yin, Jason Tsong-Li Wang
ICDM
2005
IEEE
147views Data Mining» more  ICDM 2005»
14 years 3 months ago
Partial Elastic Matching of Time Series
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 4 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey