JMLR
2010
12 years 11 months ago
2010
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
SBP
2011
Springer
12 years 11 months ago
2011
Springer
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
MLDM
2008
Springer
13 years 4 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...
IRAL
2003
ACM
13 years 9 months ago
2003
ACM
In this paper, we propose a practical approach for extracting the most relevant paragraphs from the original document to form a summary for Thai text. The idea of our approach is ...
WWW
2004
ACM
14 years 5 months ago
2004
ACM
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
ICML
1997
IEEE
14 years 5 months ago
1997
IEEE
Heuristic measures for estimating the quality of attributes mostly assume the independence of attributes so in domains with strong dependencies between attributes their performanc...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at t...