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.
This paper investigates the ability of an evolutionary pruning mechanism to improve the predictive accuracy of a classifier based on non-nested generalized exemplars. Two pruning algorithms are proposed: one which selects the most representative generalized exemplars and the other one which simultaneously selects both relevant exemplars and relevant attributes. Experimental studies conducted for a...
This paper presents a text query-based method for keyword spotting from online Chinese handwritten documents. The similarity between a text word and handwriting is obtained by combining the character similiarity scores given by a character classifier. To overcome the ambiguity of character segmentation, multiple candidates of character patterns are generated by over-segmentation, and sequences of...
Traditional pattern recognition techniques can not handle the classification of large datasets with both efficiency and effectiveness. In this context, the Optimum-Path Forest (OPF) classifier was recently introduced, trying to achieve high recognition rates and low computational cost. Although OPF was much faster than Support Vector Machines for training, it was slightly slower for classification...
Classifier ensembles based on selection-fusion strategy have recently aroused enormous interest. The main idea underlying this strategy is to use miniensembles instead of monolithic base classifiers in an ensemble in order to improve the overall performance. This paper proposes a classifier selection method to be used in selection-fusion strategies. The method involves first splitting the original...
Prototype classifiers trained with multi-class classification objective are inferior in pattern retrieval and outlier rejection. To improve the binary classification (detection, verification, retrieval, outlier rejection) performance of prototype classifiers, we propose a one-vs-all training method, which enriches each prototype as a binary discriminant function with a local threshold, and optimizes...
We present a study of designing compact recognizers of handwritten Chinese characters using multiple-prototype based classifiers. A modified Quick prop algorithm is proposed to optimize a sample-separation-margin based minimum classification error objective function. Split vector quantization technique is used to compress classifier parameters. Benchmark results are reported for classifiers with different...
Nearest neighbor is one of the most successfully used techniques for performing classification and pattern recognition tasks. Its simplicity and effectiveness justify the use of this technique in certain domains but it however presents several drawbacks referring to time response, noise sensitivity and storage requirements. Several solutions have been proposed in order to alleviate these problems,...
In traditional machine learning applications, only labeled data is used to train the classifier. Labeled data are difficult, expensive, time-consuming and require human experts to be obtained in several real applications. Semi-supervised learning address this issue. Semi-supervised learning uses large amount of unlabeled data, combined with the labeled data, to build better classifiers. The semi-supervised...
Nearest prototype methods are a successful trend of many pattern classification tasks. However, they present several shortcomings such as time response, noise sensitivity, and storage requirements. Data reduction techniques are suitable to alleviate these drawbacks. Prototype generation is an appropriate process for data reduction, which allows the fitting of a dataset for nearest neighbor (NN) classification...
This paper presents a neural network classifier based on fuzzy ARTMAP with conflict-resolving strategy. The proposed model explicitly resolves overlaps among prototypes of different classes through deploying a contraction procedure in the network, therefore, improving its generalization. Compared with other existing methods, the model has the priority of intuition and no parameter tuning. The performance...
In the last years, the area of Multicriteria Decision Analysis (MCDA) has brought about new methods to cope with classification problems, among which those based on the concept of prototypes. These refer to specific alternatives (samples) of the training dataset that are good representatives of the groups they fit in. In this paper, experiments are conducted over two prototype selection (PS) techniques...
In this paper, pruned fuzzy k-nearest neighbor (PFKNN) classifier is proposed to classify different types of arrhythmia beats present in the MIT-BIH Arrhythmia database. We have tested our classifier on ~103100 beats for six beat types present in the database. Fuzzy KNN (FKNN) can be implemented very easily but large number of training examples used for classification which can be very time consuming...
Prototype based classifiers allow to determine the class of a new example based on a reduced set of prototypes instead of using a large set of known samples. By doing this, the computational time gets substantially decreased as the initial set is replaced by a reduced one and hence the classification requires less computations to estimate nearest neighbours. In most simple classification problems...
For the improvement of QoS, incorporation of user-supplied information in the network design and control process has become mandatory. A problem arises for the handling of new users, when information about existing users is already available. In the work presented in this paper, we were following two approaches to derive information about new users, both based on prototype generation for existing...
Collecting data is very easy now owing to fast computers and ease of Internet access. It raises the problem of the curse of dimensionality to supervised classification problems. In our previous work, an Intra-Prototype / Inter-Class Separability Ratio (IPICSR) model is proposed to select relevant features for semi-supervised classification problems. In this work, a new margin based feature selection...
KNN as a simple classification method has been widely applied in text classification. There are two problems in KNN-based text classification: the large computation load and the deterioration of classification accuracy caused by the uneven distribution of training samples. To solve these problems, we propose a new growing LVQ method and apply it to text classification based on minimizing the increment...
The performances of conventional crisp and fuzzy K-nearest neighbor (K-NN) algorithms trained using finite samples tends to be poor . With ldquoholesrdquo in the training data, it is unlikely that the decision area formed can actually represent the underlying data distribution. There is a need to capture more useful information from the limited training samples, therefore we propose a new fuzzy rule-based...
Practical applications of online handwritten character recognition demand robust and highly accurate recognition along with low memory requirements. The Active-DTW classifier proposed by Sridhar et al.combines the advantages of generative and discriminative classifiers to address the similarity of between-class samples, while taking into account the variability of writing styles within the same character...
Owing to the increase of computer processing power, datasets for pattern classification problems get larger. In semi-supervised learning problems, only a portion of training samples are labeled. This further reduces the effort in data collection. In the light of this situation, the number of features increases easily and the curse of dimensionality becomes a serious problem in semi-supervised pattern...
Learning Vector Quantization (LVQ) is a popular class of nearest prototype classifiers for multiclass classification. Learning algorithms from this family are widely used because of their intuitively clear learning process and ease of implementation. They run efficiently and in many cases provide state of the art performance. In this paper we propose a modification of the LVQ algorithm that addresses...
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.