Sciweavers

2675 search results - page 322 / 535
» From Ontology to Relational Databases
Sort
View
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
16 years 3 days ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
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
CIKM
1999
Springer
15 years 11 months ago
Page Access Scheduling in Join Processing
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon
JVCIR
2010
147views more  JVCIR 2010»
15 years 5 months ago
Modeling, classifying and annotating weakly annotated images using Bayesian network
We propose a probabilistic graphical model to represent weakly annotated images1 . This model is used to classify images and automatically extend existing annotations to new image...
Sabine Barrat, Salvatore Tabbone
CVPR
2011
IEEE
15 years 2 months ago
Ordinal Hyperplanes Ranker with Cost Sensitivities for Age Estimation
In this paper, we propose an ordinal hyperplane ranking algorithm called OHRank, which estimates human ages via facial images. The design of the algorithm is based on the relative...
Kuang-Yu Chang, Chu-Song Chen, Yi-Ping Hung