Identification of a Minimal Subset of Receptor Conformations for Improved Multiple Conformation Docking and Two-Step Scoring

2004 ◽  
Vol 44 (1) ◽  
pp. 88-96 ◽  
Author(s):  
Sukjoon Yoon ◽  
William J. Welsh
1996 ◽  
Vol 05 (01n02) ◽  
pp. 99-112 ◽  
Author(s):  
NING SHAN ◽  
HOWARD J. HAMILTON ◽  
NICK CERCONE

We present the three-step GRG approach for learning decision rules from large relational databases. In the first step, an attribute-oriented concept tree ascen sion technique is applied to generalize an information system. This step loses some information but substantially improves the efficiency of the following steps. In the second step, a reduction technique is applied to generate a minimalized information system called a reduct which contains a minimal subset of the generalized attributes and the smallest number of distinct tuples for those attributes. Finally, a set of maximally general rules are derived directly from the reduct. These rules can be used to interpret and understand the active mechanisms underlying the database.


1993 ◽  
Vol 19 (3-4) ◽  
pp. 343-353
Author(s):  
Jiři Novotný ◽  
Miroslav Novotný

A concept in Wille’s context can be generated starting with a set of features. The problem of finding a minimal subset of the given set of features that generates the same concept as the given one is solved using a suitable dependence space and constructing reducts of one of its subsets. This result can be applied to information systems where it enables to cancel superfluous values of attributes.


Author(s):  
Ruwan B. Tennakoon ◽  
Alireza Bab-Hadiashar ◽  
Zhenwei Cao ◽  
Reza Hoseinnezhad ◽  
David Suter

2001 ◽  
Vol 41 (supplement) ◽  
pp. S37
Author(s):  
H. Kondo ◽  
M. Suzuki ◽  
Y. Nishimiya ◽  
K. Kawasaki

1976 ◽  
Vol SE-2 (4) ◽  
pp. 301-307 ◽  
Author(s):  
D.L. Parnas ◽  
G. Handzel ◽  
H. Wurges

Sign in / Sign up

Export Citation Format

Share Document