Sciweavers

2176 search results - page 272 / 436
» Refactoring Methods for Knowledge Bases
Sort
View
127
Voted
KDD
1997
ACM
122views Data Mining» more  KDD 1997»
15 years 7 months ago
KDD Process Planning
KDD (Knowledge Discovery in Databases) processhas become a new and important research area. Within the framework of KDD process and the GLS (Global Learning Scheme) system recentl...
Ning Zhong, Chunnian Liu, Yoshitsugu Kakemoto, Set...
155
Voted
ICCI
1993
15 years 7 months ago
Pattern Matching for Case Analysis: A Computational Definition of Closeness
We propose a conceptually and technically neat method to identify known semantic patterns close to a novel pattern. This occurs in the context of a system to acquire knowledge inc...
Sylvain Delisle, Terry Copeck, Stan Szpakowicz, Ke...
133
Voted
COMPSYSTECH
2007
15 years 7 months ago
A refinement model with information granulation focused on difficult to distinguish cases
: The paper proposes a different approach to data modeling. Analogous to the rejection method, where the misclassifications are removed and manually evaluated, we focus here on dif...
Plamena Andreeva, Plamen Andreev, Maya Dimitrova, ...
115
Voted
CONTEXT
2007
Springer
15 years 7 months ago
Using Context for the Extraction of Relational Views
The paper presents an approach for automatically extracting views from a relational database schema, based on the knowledge of the application domain. In order to achieve such resu...
Cristiana Bolchini, Elisa Quintarelli, Rosalba Ros...
124
Voted
CSR
2006
Springer
15 years 7 months ago
Extended Resolution Proofs for Conjoining BDDs
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
Carsten Sinz, Armin Biere