Sciweavers

321 search results - page 14 / 65
» Comparison of Additive Trees Using Circular Orders
Sort
View
VOSS
2004
Springer
125views Mathematics» more  VOSS 2004»
14 years 22 days ago
Probabilistic Automata: System Types, Parallel Composition and Comparison
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper...
Ana Sokolova, Erik P. de Vink
EUSFLAT
2001
13 years 8 months ago
Similarity measurement on leaf-labelled trees
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
Hans De Meyer, Bernard De Baets, Saskia Janssens
SDM
2010
SIAM
184views Data Mining» more  SDM 2010»
13 years 8 months ago
A Robust Decision Tree Algorithm for Imbalanced Data Sets
We propose a new decision tree algorithm, Class Confidence Proportion Decision Tree (CCPDT), which is robust and insensitive to class distribution and generates rules which are st...
Wei Liu, Sanjay Chawla, David A. Cieslak, Nitesh V...
BMCBI
2007
133views more  BMCBI 2007»
13 years 7 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja
CICLING
2005
Springer
14 years 28 days ago
Incremental Information Extraction Using Tree-Based Context Representations
Abstract. The purpose of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic pro...
Christian Siefkes