Sciweavers

2223 search results - page 154 / 445
» Ontological Framework for Approximation
Sort
View
CONCURRENCY
2008
98views more  CONCURRENCY 2008»
15 years 5 months ago
An ontology-based approach to handling information quality in e-Science
context. In contrast to previous approaches that take a very abstract view of IQ properties, we allow scientists to define the quality characteristics that are of importance to the...
Alun D. Preece, Paolo Missier, Suzanne M. Embury, ...
ICUMT
2009
15 years 4 months ago
Coping with variability of location sensing in large-scale ubicomp environments
The work addresses the problem of coping with a diversity of location tracking techniques available in ubiquitous computing environments. We investigate how this diversity can be e...
Petr Aksenov, Kris Luyten, Karin Coninx
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 6 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
COMBINATORICA
2010
15 years 1 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
JMLR
2010
125views more  JMLR 2010»
15 years 1 months ago
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
Jacek P. Dmochowski, Paul Sajda, Lucas C. Parra