Sciweavers

1314 search results - page 184 / 263
» Approximate data mining in very large relational data
Sort
View
ICIP
2002
IEEE
16 years 6 months ago
DPF - a perceptual distance function for image retrieval
For almost a decade, Content-Based Image Retrieval has been an active research area, yet one fundamental problem remains largely unsolved: how to measure perceptual similarity. To...
Baitao Li Chang, E. Ching-Tung Wu
PREMI
2005
Springer
15 years 10 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
CIDR
2003
138views Algorithms» more  CIDR 2003»
15 years 5 months ago
AIMS: An Immersidata Management System
We introduce a system to address the challenges involved in managing the multidimensional sensor data streams generated within immersive environments. We call this data type, imme...
Cyrus Shahabi
JDM
2006
96views more  JDM 2006»
15 years 4 months ago
Preparing Clinical Text for Use in Biomedical Research
Approximately 57 different types of clinical annotations construct a patient's medical record. The annotations include radiology reports, discharge summaries, and surgical an...
John Pestian, Lukasz Itert, Charlotte Anderson, Wl...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 8 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer