The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Time-series classification is an active research topic in machine learning, as it finds applications in numerous domains. The k-NN classifier, based on the discrete time warping (DTW) distance, had been shown to be competitive to many state-of-the art time-series classification methods. Nevertheless, due to the complexity of time-series data sets, our investigation demonstrates that a single, global...
The k-nearest neighbors classifier is simple and often results in good classification performance on problems with unknown and non-normal distributions. However, its selected nearest neighbors on noisy, sparse, or imbalanced data are often inconsistent with our intuition and in turn leads to the worse performance. This paper applies Gestalt visual perceptual laws to design a new KNN classifie r. It...
Transductive confidence machines (TCMs) when used in classification problems can provide us with reliability for every classification. Many machine learning algorithms, such as KNN algorithm, etc., have been incorporated with TCM, while there's no SOM classification method based on TCM. Considering properties of SOM map unit, this paper first designs a novel nonconformity measurement and TCM-SOM classification...
In this paper, we study various K nearest neighbor (KNN) algorithms and present a new KNN algorithm based on evidence theory. We introduce global frequency estimation of prior probability (GE) and local frequency estimation of prior probability (LE). A GE for a class is the prior probability of the class across the whole training data space based on frequency estimation; on the other hand, a LE for...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.