Estimating Null Values in Database Using CBR and Supervised Learning Classification
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2014, Vol 5, Issue 6
Abstract
Database and database systems have been used widely in almost, all life activities. Sometimes missed data items are discovered as missed or null values in the database tables. The presented paper proposes a design for a supervised learning system to estimate missed values found in the university database. The values of estimated data items or data it items used in estimation are numeric and not computed. The system performs data classification based on Case-Based Reasoning (CBR) to estimate loosed marks of students. A data set is used in training the system under the supervision of an expert. After training the system to classify and estimate null values under expert supervision, it starts classification and estimation of null data by itself.
Authors and Affiliations
Khaled ElSayed
Camera Mouse Including “Ctrl-Alt-Del” Key Operation Using Gaze, Blink, and Mouth Shape
This paper presents camera mouse system with additional feature: "CTRL - ALT - DEL" key. The previous gaze-based camera mouse systems are only considering how to obtain gaze and making selection. We proposed gaze-based c...
Experimental Use of Kit-Build Concept Map System to Support Reading Comprehension of EFL in Comparing with Selective Underlining Strategy
In this paper, we describe the effects of using Kit-Build concept mapping (KB-mapping) method as a technology-enhanced support for the Reading Comprehension (RC) in English as Foreign Language (EFL) contexts. RC is a pro...
Collaborative Editing over Opportunistic Networks: State of the Art and Challenges
Emerging Opportunistic Networks (ON) are under intensive research and development by many academics. However, research efforts on ON only addressed routing protocols as well as data dissemination. Too little attention wa...
Revisit of Logistic Regression
Logistic regression (LR) is widely applied as a powerful classification method in various fields, and a variety of optimization methods have been developed. To cope with large-scale problems, an efficient optimization me...
Relaxed Random Search for Solving K-Satisfiability and its Information Theoretic Interpretation
The problem of finding satisfying assignments for conjunctive normal formula with K literals in each clause, known as K-SAT, has attracted many attentions in the previous three decades. Since it is known as NP-Complete P...