Lazy Learning by Scanning Memory Image Lattice
نویسندگان
چکیده
SMILE (Scanning Memory Image LatticE) is a lazy learning framework based on a memory image lattice scanning technique. To classify an unseen instance, the instances in the training set will generate a memory image lattice in terms of the similarities between the training instances and the unseen instance. An exploration algorithm of memory image lattice is designed to search an appropriate set of images of training instances to produce the final prediction. SMILE differs from other lazy learning algorithms in that it utilizes subsets of attribute values as much as possible. This design leads to a more flexible model which is less sensitive to data
منابع مشابه
Image Encryption by Using Combination of DNA Sequence and Lattice Map
In recent years, the advancement of digital technology has led to an increase in data transmission on the Internet. Security of images is one of the biggest concern of many researchers. Therefore, numerous algorithms have been presented for image encryption. An efficient encryption algorithm should have high security and low search time along with high complexity.DNA encryption is one of the fa...
متن کاملMorphological and Crystallographic Characterization of Nanoparticles by Granulometry Image Analysis and Rietveld Refinement Methods
The particle size distribution of the resultant cobalt ferrite samples was determined from Scanning Electron Microscopy (SEM) images using the granulometry image analysis method. Results showed the nanosized particles of the samples. The X-Ray Diffraction (XRD) patterns of samples were also analyzed by Rietveld refinement method. The results indicated that the precipitated sample at 95 <sup...
متن کاملEnabling Lazy Learning for Uncertain Data Streams
Lazy learning concept is performing the k-nearest neighbor algorithm, Is used to classification and similarly 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 learning process is consumes the high memory and low prediction Efficiency .this process is...
متن کاملFamiliar Problem Space (FPS): A Novel Approach for Brain-like Learning
Lazy learning methods search for the match, while there may be no exact match, so the best match is called for. Unfortunately, there is no general way to search memory for the best match without examining every element of memory. It is proven that brain can not traverse more than 100 neurons in less then 200 milliseconds which we need to solve most of our routine decisions. This paper (inspired...
متن کاملLazy learning for control design
This paper presents two local methods for the control of discrete-time unknown nonlinear dynamical systems, when only a limited amount of input-output data is available. The modeling procedure adopts lazy learning, a query-based approach for local modeling inspired to memory-based approximators. In the first method the lazy technique returns the forward and inverse models of the system which ar...
متن کامل