Sciweavers

705 search results - page 69 / 141
» Approximating Extended Answer Sets
Sort
View
DIS
2009
Springer
15 years 4 months ago
Subspace Discovery for Promotion: A Cell Clustering Approach
The promotion analysis problem has been proposed in [16], where ranking-based promotion query processing techniques are studied to effectively and efficiently promote a given obje...
Tianyi Wu, Jiawei Han
ICML
2010
IEEE
14 years 11 months ago
Graded Multilabel Classification: The Ordinal Case
We propose a generalization of multilabel classification that we refer to as graded multilabel classification. The key idea is that, instead of requesting a yes-no answer to the q...
Weiwei Cheng, Krzysztof Dembczynski, Eyke Hül...
COMMA
2010
14 years 4 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
15 years 10 months ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...
PPDP
2010
Springer
14 years 7 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu