Sciweavers

5221 search results - page 699 / 1045
» An On-line Problem Database
Sort
View
187
Voted
WWW
2006
ACM
16 years 7 months ago
Tables and trees don't mix (very well)
There are principal differences between the relational model and XML's tree model. This causes problems in all cases where information from these two worlds has to be brought...
Erik Wilde
168
Voted
WWW
2001
ACM
16 years 7 months ago
A unified constraint model for XML
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Gabriel M. Kuper, Jérôme Siméo...
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 7 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 7 months ago
Is there a grand challenge or X-prize for data mining?
This panel will discuss possible exciting and motivating Grand Challenge problems for Data Mining, focusing on bioinformatics, multimedia mining, link mining, text mining, and web...
Gregory Piatetsky-Shapiro, Robert Grossman, Chaban...
KDD
2004
ACM
123views Data Mining» more  KDD 2004»
16 years 7 months ago
A DEA approach for model combination
This paper proposes a novel Data Envelopment Analysis (DEA) based approach for model combination. We first prove that for the 2-class classification problems DEA models identify t...
Zhiqiang Zheng, Balaji Padmanabhan, Haoqiang Zheng