3168 search results - page 47 / 634 » Neutrosophic Relational Data Model |
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
In many prediction tasks, selecting relevant features is essential for achieving good generalization performance. Most feature selection algorithms consider all features to be a p...
ISMIS
2009
Springer
14 years 3 months ago
2009
Springer
Many clustering methods are based on flat descriptions, while data regarding real-world domains include heterogeneous objects related to each other in multiple ways. For instance,...
APPINF
2003
13 years 10 months ago
2003
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
SP
1991
IEEE
14 years 7 days ago
1991
IEEE
In this paper we give a new decomposition algorithm that breaks a multilevel relation into single-level relations and a new recovery algorithmwhich reconstructs the original multi...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...