Sciweavers

3694 search results - page 681 / 739
» Stochastic complexity in learning
Sort
View
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
14 years 9 months ago
A multi-relational approach to spatial classification
Spatial classification is the task of learning models to predict class labels based on the features of entities as well as the spatial relationships to other entities and their fe...
Richard Frank, Martin Ester, Arno Knobbe
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 9 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
KDD
2003
ACM
180views Data Mining» more  KDD 2003»
14 years 9 months ago
Classifying large data sets using SVMs with hierarchical clusters
Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convey several salient ...
Hwanjo Yu, Jiong Yang, Jiawei Han
CHI
2007
ACM
14 years 9 months ago
How it works: a field study of non-technical users interacting with an intelligent system
In order to develop intelligent systems that attain the trust of their users, it is important to understand how users perceive such systems and develop those perceptions over time...
Joe Tullio, Anind K. Dey, Jason Chalecki, James Fo...