Sciweavers

1860 search results - page 80 / 372
» Boosting Methods for Regression
Sort
View
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 10 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
NIPS
2003
13 years 11 months ago
Sequential Bayesian Kernel Regression
We propose a method for sequential Bayesian kernel regression. As is the case for the popular Relevance Vector Machine (RVM) [10, 11], the method automatically identifies the num...
Jaco Vermaak, Simon J. Godsill, Arnaud Doucet
IJCNN
2008
IEEE
14 years 4 months ago
A neural network approach to ordinal regression
— Ordinal regression is an important type of learning, which has properties of both classification and regression. Here we describe an effective approach to adapt a traditional ...
Jianlin Cheng, Zheng Wang, Gianluca Pollastri
EMNLP
2008
13 years 11 months ago
Ranking Reader Emotions Using Pairwise Loss Minimization and Emotional Distribution Regression
This paper presents two approaches to ranking reader emotions of documents. Past studies assign a document to a single emotion category, so their methods cannot be applied directl...
Kevin Hsin-Yih Lin, Hsin-Hsi Chen
CSDA
2004
77views more  CSDA 2004»
13 years 9 months ago
Variable selection bias in regression trees with constant fits
The greedy search approach to variable selection in regression trees with constant fits is considered. At each node, the method usually compares the maximally selected statistic a...
Yu-Shan Shih, Hsin-Wen Tsai