Sciweavers

849 search results - page 164 / 170
» Learning to Solve Problems from Exercises
Sort
View
DASFAA
2004
IEEE
135views Database» more  DASFAA 2004»
13 years 11 months ago
Semi-supervised Text Classification Using Partitioned EM
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
Gao Cong, Wee Sun Lee, Haoran Wu, Bing Liu
CACM
2002
145views more  CACM 2002»
13 years 7 months ago
Digital city Kyoto
Abstract. We have developed a digital city for Kyoto, the old capital and cultural center of Japan, as a social information infrastructure for urban everyday life including shoppin...
Toru Ishida
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 8 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
CEC
2007
IEEE
14 years 1 months ago
Concerning the potential of evolutionary support vector machines
— Within the present paper, we put forward a novel hybridization between support vector machines and evolutionary algorithms. Evolutionary support vector machines consider the cl...
Ruxandra Stoean, Mike Preuss, Catalin Stoean, Dumi...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 1 days ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...