Efficient supervised optimum-path forest classification for large datasets

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Schwarzschild generalized black hole horizon and the embedding space

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Unusual Yang-Lee edge singularity in the one-dimensional axial-next-to-nearest-neighbor Ising model

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Generalized neighbor-interaction models induced by nonlinear lattices

It is shown that the tight-binding approximation of the nonlinear Schrodinger equation with a periodic linear potential and periodic in space nonlinearity coefficient gives rise to a number of nonlinear lattices with complex, both linear and nonlinear, neighbor interactions. The obtained lattices present nonstandard possibilities, among which we mention a quasilinear regime, where the pulse dynamics obeys essentially the linear Schrodinger equation. We analyze the properties of such models both in connection to their modulational stability, as well as in regard to the existence and stability of their localized solitary wave solutions.

Transition to complete synchronization in phase-coupled oscillators with nearest neighbor coupling

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Particle Competition and Cooperation in Networks for Semi-Supervised Learning

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Particle Competition and Cooperation in Networks for Semi-Supervised Learning with Concept Drift

Concept drift is a problem of increasing importance in machine learning and data mining. Data sets under analysis are no longer only static databases, but also data streams in which concepts and data distributions may not be stable over time. However, most learning algorithms produced so far are based on the assumption that data comes from a fixed distribution, so they are not suitable to handle concept drifts. Moreover, some concept drifts applications requires fast response, which means an algorithm must always be (re) trained with the latest available data. But the process of labeling data is usually expensive and/or time consuming when compared to unlabeled data acquisition, thus only a small fraction of the incoming data may be effectively labeled. Semi-supervised learning methods may help in this scenario, as they use both labeled and unlabeled data in the training process. However, most of them are also based on the assumption that the data is static. Therefore, semi-supervised learning with concept drifts is still an open challenge in machine learning. Recently, a particle competition and cooperation approach was used to realize graph-based semi-supervised learning from static data. In this paper, we extend that approach to handle data streams and concept drift. The result is a passive algorithm using a single classifier, which naturally adapts to concept changes, without any explicit drift detection mechanism. Its built-in mechanisms provide a natural way of learning from new data, gradually forgetting older knowledge as older labeled data items became less influent on the classification of newer data items. Some computer simulation are presented, showing the effectiveness of the proposed method.

Influence of nearest-neighbor Coulomb interactions on the phase diagram of the ferromagnetic Kondo model

The influence of a nearest-neighbor Coulomb repulsion of strength V on the properties of the ferromagnetic Kondo model is analyzed using computational techniques. The Hamiltonian studied here is defined on a chain using localized S = 1/2 spins, and one orbital per site. Special emphasis is given to the influence of the Coulomb repulsion on the regions of phase separation recently discovered in this family of models, as well as on the double-exchange-induced ferromagnetic ground state. When phase separation dominates at V= 0, the Coulomb interaction breaks the large domains of the two competing phases into small islands of one phase embedded into the other. This is in agreement with several experimental results, as discussed in the text. Vestiges of the original phase separation regime are found in the spin structure factor as incommensurate peaks, even at large values of V. In the ferromagnetic regime close to density n = 0.5, the Coulomb interaction induces tendencies to charge ordering without altering the fully polarized character of the state. This regime of charge-ordered ferromagnetism may be related with experimental observations of a similar phase by Chen and Cheong [Phys. Rev. Lett. 76, 4042 (1996)]. Our results reinforce the recently introduced notion [see, e.g., S. Yunoki et al., Phys. Rev. Lett. 80, 845 (1998)] that in realistic models for manganites analyzed with unbiased many-body techniques, the ground state properties arise from a competition between ferromagnetism and phase-separation - charge-ordering tendencies. ©1999 The American Physical Society.

Improving the accuracy of the optimum-path forest supervised classifier for large datasets

In this work, a new approach for supervised pattern recognition is presented which improves the learning algorithm of the Optimum-Path Forest classifier (OPF), centered on detection and elimination of outliers in the training set. Identification of outliers is based on a penalty computed for each sample in the training set from the corresponding number of imputable false positive and false negative classification of samples. This approach enhances the accuracy of OPF while still gaining in classification time, at the expense of a slight increase in training time. © 2010 Springer-Verlag.

Particle competition and cooperation to prevent error propagation from mislabeled data in semi-supervised learning

Semi-supervised learning is applied to classification problems where only a small portion of the data items is labeled. In these cases, the reliability of the labels is a crucial factor, because mislabeled items may propagate wrong labels to a large portion or even the entire data set. This paper aims to address this problem by presenting a graph-based (network-based) semi-supervised learning method, specifically designed to handle data sets with mislabeled samples. The method uses teams of walking particles, with competitive and cooperative behavior, for label propagation in the network constructed from the input data set. The proposed model is nature-inspired and it incorporates some features to make it robust to a considerable amount of mislabeled data items. Computer simulations show the performance of the method in the presence of different percentage of mislabeled data, in networks of different sizes and average node degree. Importantly, these simulations reveals the existence of the critical points of the mislabeled subset size, below which the network is free of wrong label contamination, but above which the mislabeled samples start to propagate their labels to the rest of the network. Moreover, numerical comparisons have been made among the proposed method and other representative graph-based semi-supervised learning methods using both artificial and real-world data sets. Interestingly, the proposed method has increasing better performance than the others as the percentage of mislabeled samples is getting larger. © 2012 IEEE.

Tooth embedding medium influences the accuracy of electronic apex locator

This study evaluated the influence of tooth embedding media on the accuracy ofan electronic apex locator. The root canal length of 20 human mandibular canines was measured by inserting a 15 K-file into the root canal up to the apical foramen. The distance was measured with a digital caliper. The embedding media evaluated were alginate, saline, floral foam or gauze soaked in saline. Electronic root canal length measurement was performed with Root ZX II. Data were analysed using ANOVA for repeated measurements and Tukey test, at a significance level of 5%. There was no difference between the actual root canal length measurement and the electronic reading recorded with alginate medium. The readings obtained with the other media differed from the actual root canal length measurements. Alginate provided greater accuracy in electronic root canal length determination by Root ZX II than saline, floral foam and gauze.

Combined active and semi-supervised learning using particle walking temporal dynamicscombined active and semi-supervised learning using particle walking temporal dynamics

Both Semi-Supervised Leaning and Active Learning are techniques used when unlabeled data is abundant, but the process of labeling them is expensive and/or time consuming. In this paper, those two machine learning techniques are combined into a single nature-inspired method. It features particles walking on a network built from the data set, using a unique random-greedy rule to select neighbors to visit. The particles, which have both competitive and cooperative behavior, are created on the network as the result of label queries. They may be created as the algorithm executes and only nodes affected by the new particles have to be updated. Therefore, it saves execution time compared to traditional active learning frameworks, in which the learning algorithm has to be executed several times. The data items to be queried are select based on information extracted from the nodes and particles temporal dynamics. Two different rules for queries are explored in this paper, one of them is based on querying by uncertainty approaches and the other is based on data and labeled nodes distribution. Each of them may perform better than the other according to some data sets peculiarities. Experimental results on some real-world data sets are provided, and the proposed method outperforms the semi-supervised learning method, from which it is derived, in all of them.

Semi-supervised learning with concept drift using particle dynamics applied to network intrusion detection data

Concept drift, which refers to non stationary learning problems over time, has increasing importance in machine learning and data mining. Many concept drift applications require fast response, which means an algorithm must always be (re)trained with the latest available data. But the process of data labeling is usually expensive and/or time consuming when compared to acquisition of unlabeled data, thus usually only a small fraction of the incoming data may be effectively labeled. Semi-supervised learning methods may help in this scenario, as they use both labeled and unlabeled data in the training process. However, most of them are based on assumptions that the data is static. Therefore, semi-supervised learning with concept drifts is still an open challenging task in machine learning. Recently, a particle competition and cooperation approach has been developed to realize graph-based semi-supervised learning from static data. We have extend that approach to handle data streams and concept drift. The result is a passive algorithm which uses a single classifier approach, naturally adapted to concept changes without any explicit drift detection mechanism. It has built-in mechanisms that provide a natural way of learning from new data, gradually "forgetting" older knowledge as older data items are no longer useful for the classification of newer data items. The proposed algorithm is applied to the KDD Cup 1999 Data of network intrusion, showing its effectiveness.

Particle competition and cooperation for semi-supervised learning with label noise

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)