Sciweavers

447 search results - page 4 / 90
» Generalization from Observed to Unobserved Features by Clust...
Sort
View
PAKM
2008
14 years 11 months ago
Classifying Digital Resources in a Practical and Coherent Way with Easy-to-Get Features
With a rich variety of forms and types, digital resources are complex data objects. They grows fast in volume on the Web, but hard to be classified efficiently. The paper presents ...
Chong Chen, Hongfei Yan, Xiaoming Li
IDEAL
2000
Springer
15 years 1 months ago
Observational Learning with Modular Networks
Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for ...
Hyunjung Shin, Hyoungjoo Lee, Sungzoon Cho
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 9 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
15 years 1 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
EMNETS
2007
15 years 1 months ago
Image browsing, processing, and clustering for participatory sensing: lessons from a DietSense prototype
Imagers are an increasingly significant source of sensory observations about human activity and the urban environment. ImageScape is a software tool for processing, clustering, an...
Sasank Reddy, Andrew Parker, Josh Hyman, Jeff Burk...