default search action
1. ACML 2009: Nanjing, China
- Zhi-Hua Zhou, Takashi Washio:
Advances in Machine Learning, First Asian Conference on Machine Learning, ACML 2009, Nanjing, China, November 2-4, 2009. Proceedings. Lecture Notes in Computer Science 5828, Springer 2009, ISBN 978-3-642-05223-1
Keynote and Invited Talks
- Thomas G. Dietterich:
Machine Learning and Ecosystem Informatics: Challenges and Opportunities. 1-5 - Masashi Sugiyama:
Density Ratio Estimation: A New Versatile Tool for Machine Learning. 6-9 - Qiang Yang:
Transfer Learning beyond Text Classification. 10-22
Regular Papers
- Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer, Ricard Gavaldà:
Improving Adaptive Bagging Methods for Evolving Data Streams. 23-37 - Remco R. Bouckaert:
A Hierarchical Face Recognition Algorithm. 38-50 - Wray L. Buntine:
Estimating Likelihoods for Topic Models. 51-64 - Eibe Frank, Remco R. Bouckaert:
Conditional Density Estimation with Class Probability Estimators. 65-81 - Ryohei Fujimaki, Satoshi Morinaga, Michinari Momma, Kenji Aoki, Takayuki Nakata:
Linear Time Model Selection for Mixture of Heterogeneous Components. 82-97 - Yuhong Guo:
Max-margin Multiple-Instance Learning via Semidefinite Programming. 98-108 - Yuhong Guo, Dale Schuurmans:
A Reformulation of Support Vector Machines for General Confidence Functions. 109-119 - Ran He, Bao-Gang Hu, Xiaotong Yuan:
Robust Discriminant Analysis Based on Nonparametric Maximum Entropy. 120-134 - Derek Hao Hu, Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng Chen:
Context-Aware Online Commercial Intention Detection. 135-149 - Qinghua Hu, Xunjian Che, Jinfu Liu:
Feature Selection via Maximizing Neighborhood Soft Margin. 150-161 - Lei Jia, Shizhong Liao:
Accurate Probabilistic Error Bound for Eigenvalues of Kernel Matrix. 162-175 - Qixia Jiang, Yan Zhang, Maosong Sun:
Community Detection on Weighted Networks: A Variational Bayesian Method. 176-190 - Mori Kurokawa, Hiroyuki Yokoyama, Akito Sakurai:
Averaged Naive Bayes Trees: A New Extension of AODE. 191-205 - Gayle Leen, David R. Hardoon, Samuel Kaski:
Automatic Choice of Control Measurements. 206-219 - Bo Li, Hong Chang, Shiguang Shan, Xilin Chen:
Coupled Metric Learning for Face Recognition with Degraded Images. 220-233 - Qiujie Li, Yaobin Mao, Zhiquan Wang, Wenbo Xiang:
Cost-Sensitive Boosting: Fitting an Additive Asymmetric Logistic Regression Model. 234-247 - Xin Li, William K. Cheung, Jiming Liu:
On Compressibility and Acceleration of Orthogonal NMF for POMDP Compression. 248-262 - Yan Li, Edward Hung:
Building a Decision Cluster Forest Model to Classify High Dimensional Data with Multi-classes. 263-277 - Krikamol Muandet, Sanparith Marukatat, Cholwich Nattee:
Query Selection via Weighted Entropy in Graph-Based Semi-supervised Classification. 278-292 - Manas A. Pathak, Eric Nyberg:
Learning Algorithms for Domain Adaptation. 293-307 - Wei Qu, Yang Zhang, Junping Zhu, Qiang Qiu:
Mining Multi-label Concept-Drifting Data Streams Using Dynamic Classifier Ensemble. 308-321 - Kazumi Saito, Masahiro Kimura, Kouzou Ohara, Hiroshi Motoda:
Learning Continuous-Time Information Diffusion Model for Social Behavioral Data Analysis. 322-337 - Jun Sakuma, Rebecca N. Wright:
Privacy-Preserving Evaluation of Generalization Error and Its Application to Model and Attribute Selection. 338-353 - Jeong Woo Son, Hyun-Je Song, Seong-Bae Park, Se-Young Park:
Coping with Distribution Change in the Same Domain Using Similarity-Based Instance Weighting. 354-366 - Guy Van den Broeck, Kurt Driessens, Jan Ramon:
Monte-Carlo Tree Search in Poker Using Expected Reward Distributions. 367-381 - Han Xiao, Xiaojie Wang, Chao Du:
Injecting Structured Data to Generative Topic Model in Enterprise Settings. 382-395 - Jiho Yoo, Seungjin Choi:
Weighted Nonnegative Matrix Co-Tri-Factorization for Collaborative Prediction. 396-411
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.