The Concept of Good Classification (Diagnostic) Test: Computer Science & IT Book Chapter | IGI Global

×

Receive a 20% Discount on All Purchases Directly Through IGI Global's Online Bookstore.
Additionally, libraries can receive an extra 5% discount. Learn More

Subscribe to the latest research through IGI Global's new InfoSci-OnDemand Plus

InfoSci®-OnDemand Plus, a subscription-based service, provides researchers the ability to access full-text content from over 100,000 peer-reviewed book chapters and 26,000+ scholarly journal articles covering 11 core subjects. Users can select articles or chapters that meet their interests and gain access to the full content permanently in their personal online InfoSci-OnDemand Plus library.

Purchase the Encyclopedia of Information Science and Technology, Fourth Edition and Receive Complimentary E-Books of Previous Editions

When ordering directly through IGI Global's Online Bookstore, receive the complimentary e-books for the first, second, and third editions with the purchase of the Encyclopedia of Information Science and Technology, Fourth Edition e-book.

Create a Free IGI Global Library Account to Receive a 25% Discount on All Purchases

Exclusive benefits include one-click shopping, flexible payment options, free COUNTER 4 and MARC records, and a 25% discount on all titles as well as the award-winning InfoSci^{®}-Databases.

InfoSci^{®}-Journals Annual Subscription Price for New Customers: As Low As US$ 5,100

This collection of over 175 e-journals offers unlimited access to highly-cited, forward-thinking content in full-text PDF and HTML with no DRM. There are no platform or maintenance fees and a guarantee of no more than 5% increase annually.

Naidenova, Xenia. "The Concept of Good Classification (Diagnostic) Test." Machine Learning Methods for Commonsense Reasoning Processes: Interactive Models. IGI Global, 2010. 165-210. Web. 23 Oct. 2018. doi:10.4018/978-1-60566-810-9.ch007

APA

Naidenova, X. (2010). The Concept of Good Classification (Diagnostic) Test. In X. Naidenova (Ed.), Machine Learning Methods for Commonsense Reasoning Processes: Interactive Models (pp. 165-210). Hershey, PA: IGI Global. doi:10.4018/978-1-60566-810-9.ch007

Chicago

Naidenova, Xenia. "The Concept of Good Classification (Diagnostic) Test." In Machine Learning Methods for Commonsense Reasoning Processes: Interactive Models, ed. Xenia Naidenova, 165-210 (2010), accessed October 23, 2018. doi:10.4018/978-1-60566-810-9.ch007

In this chapter, the definition of good diagnostic test and the characterization of good tests are introduced and the concepts of good maximally redundant and good irredundant tests are given. The algorithms for inferring all kinds of good diagnostic tests are described in detail.

In chapter 6, we considered the set L(I(T)) of partitions produced by closing atomic partitions of I(T) with the use of operations + and * on partitions. This set is the algebraic lattice with constants over U. Now we consider the table of examples T(U∪К) with partition interpretation I(T∪K) over U’= U∪К and the algebraic lattice L(I(U’)) with constants over U’, where K is a given goal attribute.

Let X ⊆ U is a test for a goal attribute К, and partitions P(X), P(K) are the interpretations of X and K, respectively.

Denote by Q(K) the set of all diagnostic tests for K: Q(K) ={X: X ⊆ U: P(X) ≤ P(K))}.

Sub-lattice LK(I(U’)) of L(I(U’)): LK(I(U’)) = {Р: Р ≤ P(K)} is the principal ideal generated by P(K) in L(I(U’)) (see, please, definition 6.3 of principal ideal in Chapter 6).

For definition of good test, we use partition dependency: P(X) ⊆ P(К) (Х ≤ К ≡ X*K = X ≡ X + K = K).

If P(X) = P(K), then X is the ideal approximation of classification K.

Of all tests X, X ⊆ U, P(X) ⊂ P(K), the good test will be Х such that P(X) is the closest to P(K) element of LK(I(U’)), i. e., for all P(Y), Y ⊆ U condition (P(X) ⊆ P(Y) ⊆ P(K)) implies P(X) = P(Y). Thus, we come to the following definition of a good diagnostic test.

Definition 7.1. A collection X ⊆ U is a good test or a good approximation of К of T if the following conditions are satisfied

а) X ∈ Q(K);

b)

there does not exist a collection of attributes Z, Z ⊆ U, X ≠ Z such that Z ∈ Q(K) and P(X) < P(Z) ≤ P(K).

We introduce the concept of the best diagnostic test as follows.

Definition 7.2. A good test X, X ⊆ U is the best one for a given classification K of T if the number of classes in partition P(X) is the smallest for all tests of Q(K).