Sciweavers

4523 search results - page 22 / 905
» Using randomization in the teaching of data structures and a...
Sort
View
IDA
2007
Springer
14 years 2 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
BMCBI
2007
128views more  BMCBI 2007»
13 years 8 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
PAMI
2010
396views more  PAMI 2010»
13 years 6 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu
WWW
2010
ACM
13 years 8 months ago
LINKREC: a unified framework for link recommendation with user attributes and graph structure
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
GIS
2009
ACM
14 years 1 months ago
Data structures and intersection algorithms for 3D spatial data types
Apart from visualization tasks, three-dimensional (3D) data management features are not or only hardly available in current spatial database systems and Geographic Information Sys...
Tao Chen, Markus Schneider