Sciweavers

614 search results - page 44 / 123
» Decision Trees for Uncertain Data
Sort
View
IGARSS
2010
14 years 11 months ago
New hyperspectral data representation using binary partition tree
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
16 years 2 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
IPMU
2010
Springer
15 years 13 days ago
Attribute Value Selection Considering the Minimum Description Length Approach and Feature Granularity
Abstract. In this paper we introduce a new approach to automatic attribute and granularity selection for building optimum regression trees. The method is based on the minimum descr...
Kemal Ince, Frank Klawonn
BMCBI
2010
118views more  BMCBI 2010»
15 years 2 months ago
Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests
Background: To understand the evolutionary role of Lateral Gene Transfer (LGT), accurate methods are needed to identify transferred genes and infer their timing of acquisition. Ph...
Sophie S. Abby, Eric Tannier, Manolo Gouy, Vincent...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 8 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