Sciweavers

110 search results - page 5 / 22
» Forest trees for on-line data
Sort
View
RECOMB
2012
Springer
11 years 9 months ago
Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem
Signaling networks are essential for cells to control processes such as growth and response to stimuli. Although many “omic” data sources are available to probe signaling pathw...
Nurcan Tuncbag, Alfredo Braunstein, Andrea Pagnani...
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 7 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
KDD
2009
ACM
157views Data Mining» more  KDD 2009»
14 years 2 months ago
Hierarchical difference scatterplots interactive visual analysis of data cubes
Data cubes as employed by On-Line Analytical Processing (OLAP) play a key role in many application domains. The analysis typically involves to compare categories of different hie...
Harald Piringer, Matthias Buchetics, Helwig Hauser...
SAC
2004
ACM
14 years 26 days ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha
ICIP
2010
IEEE
13 years 5 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao