Sciweavers

240 search results - page 27 / 48
» On Efficient Construction of Decision Trees from Large Datab...
Sort
View
DAWAK
2000
Springer
13 years 12 months ago
Optimal Multidimensional Query Processing Using Tree Striping
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...
Stefan Berchtold, Christian Böhm, Daniel A. K...
BMCBI
2008
71views more  BMCBI 2008»
13 years 7 months ago
Examining the significance of fingerprint-based classifiers
Background: Experimental examinations of biofluids to measure concentrations of proteins or their fragments or metabolites are being explored as a means of early disease detection...
Brian T. Luke, Jack R. Collins
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 8 months ago
Privacy-Preserving Data Mining through Knowledge Model Sharing
Privacy-preserving data mining (PPDM) is an important topic to both industry and academia. In general there are two approaches to tackling PPDM, one is statistics-based and the oth...
Patrick Sharkey, Hongwei Tian, Weining Zhang, Shou...
ICDE
2008
IEEE
142views Database» more  ICDE 2008»
14 years 9 months ago
An Inflationary Fixed Point Operator in XQuery
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
Loredana Afanasiev, Torsten Grust, Maarten Marx, J...
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...