227 search results - page 10 / 46 » Rough Set Methods in Approximation of Hierarchical Concepts |
APSEC
2000
IEEE
15 years 3 months ago
2000
IEEE
It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modell...
GECCO
2008
Springer
15 years 3 days ago
2008
Springer
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
108
click to vote
SIGMOD
2001
ACM
15 years 11 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
144
Voted
CORR
1999
Springer
14 years 10 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
72
Voted
WWW
2007
ACM
15 years 11 months ago
2007
ACM
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...