Enabling Lazy Learning for Uncertain Data Streams
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 6
Abstract
Abstract: Lazy learning concept is performing the k-nearest neighbor algorithm, Is used to classification andsimilarly to clustering of k-nearest neighbor algorithm both are based on Euclidean distance based algorithm.Lazy learning is more advantages for complex and dynamic learning on data streams. In this lazy learningprocess is consumes the high memory and low prediction Efficiency .this process is less support to the datastream applications. Lazy learning stores the trained data and the inductive process is different until a query isappears, In the data stream applications, the data records flow is continuously in huge volume of data and theprediction of class labels are need to be made in the timely manner. In this paper provide the systematicsolution to overcome the memory and efficiency. In this paper proposed a indexing techniques it is dynamicallymaintained the historical or outdated data stream records. In this paper proposed the tree structure i.e. Novellazy tree simply called Lazy tree or L-tree.it is the height balanced tree or performing the tree traversingtechniques to maintain the trained data. These are help to reduce the memory consumption and prediction italso reduces the time complexity. L-tree is continuously absorb the newly coming stream records and discardedthe historical. They are dynamically changes occurred in data streams efficiency for prediction. They areexperiments on the real world data streams and uncertain data streams. In this paper experiment on theuncertain data streams .Our experimented uncertain data streams and real world data streams areobtained from UCI Repository.
Authors and Affiliations
Suresh. M , Dr. MHM. Krishna Prasad
Keywords
Related Articles
- EP ID EP158144
- DOI -
- Views 78
- Downloads 0
Recapitulating the development initiatives of a robust information security safeguard: RITSB-the proposed solution
Most current information security systems performance vary with the nature of the filed its being operating. With an increased emphasizes on the adoption of security tools and technologies, the anomalies and &nb...
Object Elimination and Reconstruction Using an Effective Inpainting Method
Three major problems have been found in the existing algorithms of image inpainting: Reconstruction of large regions, Preference of filling-in and Choice of best exemplars to synthesize the missing reg...
Enhancement in Weighted PageRank Algorithm Using VOL
There are billions of web pages available on the World Wide Web (WWW). So there are lots of search results corresponding to a user’s query out of which only some are relevant. The relevancy of a web page is cal...
Design and Implementation of Automatic Irrigation ControlSystem
Abstract: The objective of irrigation is to keep measure on food security and the aim of automatic irrigationcontrol system is to minimize the intervention of the human operator (gardener) in irrigation activities. Theau...
Decision Making and Autonomic Computing
Autonomic Computing refers to the self-managing characteristics of distributed computing resources, adapting to unpredictable changes while hiding intrinsic complexity to operators and users. An autonomic system...