Sciweavers

728 search results - page 85 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
KDD
2002
ACM
136views Data Mining» more  KDD 2002»
14 years 8 months ago
Relational Markov models and their application to adaptive web navigation
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
Corin R. Anderson, Pedro Domingos, Daniel S. Weld
PKDD
2010
Springer
122views Data Mining» more  PKDD 2010»
13 years 6 months ago
Exploration in Relational Worlds
Abstract. One of the key problems in model-based reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large relational domains, in wh...
Tobias Lang, Marc Toussaint, Kristian Kersting
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 10 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
ICDM
2006
IEEE
146views Data Mining» more  ICDM 2006»
14 years 1 months ago
Boosting Kernel Models for Regression
This paper proposes a general boosting framework for combining multiple kernel models in the context of both classification and regression problems. Our main approach is built on...
Ping Sun, Xin Yao
ICDM
2005
IEEE
146views Data Mining» more  ICDM 2005»
14 years 1 months ago
Merging Interface Schemas on the Deep Web via Clustering Aggregation
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Wensheng Wu, AnHai Doan, Clement T. Yu