Sciweavers

534 search results - page 7 / 107
» Approximation of Indistinct Concepts
Sort
View
PODS
2012
ACM
240views Database» more  PODS 2012»
11 years 10 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
RSFDGRC
2005
Springer
14 years 1 months ago
Ontological Framework for Approximation
We discuss an ontological framework for approximation, i.e., to approximation of concepts and vague dependencies specified in a given ontology. The presented approach is based on ...
Jaroslaw Stepaniuk, Andrzej Skowron
MOC
2011
13 years 2 months ago
Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
Len Bos, Jean-Paul Calvi, Norman Levenberg, Alvise...
RSFDGRC
2005
Springer
133views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
Rough Set Approximation Based on Dynamic Granulation
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
Jiye Liang, Yuhua Qian, Chengyuan Chu, Deyu Li, Ju...
WWW
2007
ACM
14 years 8 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...