EFFICIENT FAULT LOCATION IN UNDERGROUND DISTRIBUTION SYSTEMS THROUGH OPTIMUM-PATH FOREST

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

Fault location in underground systems through optimum-path forest

In this paper we propose an accurate method for fault location in underground distribution systems by means of an Optimum-Path Forest (OPF) classifier. We applied the Time Domains Reflectometry method for signal acquisition, which was further analyzed by OPF and several other well known pattern recognition techniques. The results indicated that OPF and Support Vector Machines outperformed Artificial Neural Networks classifier. However, OPF has been much more efficient than all classifiers for training, and the second one faster for classification. © 2011 IEEE.

An Optimum-Path Forest framework for intrusion detection in computer networks

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

A New Approach for Nontechnical Losses Detection Based on Optimum-Path Forest

Nowadays, fraud detection is important to avoid nontechnical energy losses. Various electric companies around the world have been faced with such losses, mainly from industrial and commercial consumers. This problem has traditionally been dealt with using artificial intelligence techniques, although their use can result in difficulties such as a high computational burden in the training phase and problems with parameter optimization. A recently-developed pattern recognition technique called optimum-path forest (OPF), however, has been shown to be superior to state-of-the-art artificial intelligence techniques. In this paper, we proposed to use OPF for nontechnical losses detection, as well as to apply its learning and pruning algorithms to this purpose. Comparisons against neural networks and other techniques demonstrated the robustness of the OPF with respect to commercial losses automatic identification.

Production and body composition traits of broilers in relation to breast weight evaluated by path analysis

O peso do peito possui grande importância econômica na indústria de frangos, podendo estar associado a outras variáveis passíveis de seleção. Estimaram-se correlações fenotípicas entre características de desempenho (peso vivo aos 7, 28 dias e ao abate e profundidade de músculo peitoral por ultra-sonografia), carcaça (peso eviscerado e de pernas) e composição corporal (peso do coração, do fígado e da gordura abdominal), em uma linhagem de frangos, e quantificou-se a influência direta e indireta destas variáveis sobre o peso do peito. Para tanto, utilizou-se a análise de trilha, desdobrando-se a matriz de correlações parciais em coeficientes que forneceram a influência direta de uma variável sobre a outra, independentemente das demais. A manutenção das variáveis peso vivo ao abate e peso eviscerado na matriz de correlações pode ser prejudicial à análise estatística que envolve os sistemas de equações normais, como a análise de trilha, devido à multicolinearidade observada. O peso vivo ao abate e a profundidade do músculo peitoral por ultra-sonografia apresentaram efeitos diretos importantes sobre o peso de peito e foram identificadas como as principais responsáveis pela magnitude dos coeficientes de correlação obtidos. Assim, uma pré-seleção individual para estas características pode favorecer um aumento no peso de peito nesta linhagem, se mantidas as condições ambientais de criação dos frangos, uma vez que o peso vivo ao abate e a profundidade de músculo peitoral por ultra-sonografia afetam fenotipicamente e diretamente o peso de peito.

Quantum propagator for some classes of three-dimensional three-body systems

In this work we solve exactly a class of three-body propagators for the most general quadratic interactions in the coordinates, for arbitrary masses and couplings. This is done both for the constant as the time-dependent couplings and masses, by using the Feynman path integral formalism. Finally, the energy spectrum and the eigenfunctions are recovered from the propagators. © 2005 Elsevier Inc. All rights reserved.

Oropharyngeal dysphagia identification using wavelets and optimum path forest

The swallowing disturbers are defined as oropharyngeal dysphagia when present specifies signals and symptoms that are characterized for alterations in any phases of swallowing. Early diagnosis is crucial for the prognosis of patients with dysphagia and the potential to diagnose dysphagia in a noninvasive manner by assessing the sounds of swallowing is a highly attractive option for the dysphagia clinician. This study proposes a new framework for oropharyngeal dysphagia identification, having two main contributions: a new set of features extract from swallowing signal by discrete wavelet transform and the dysphagia classification by a novel pattern classifier called OPF. We also employed the well known SVM algorithm in the dysphagia identification task, for comparison purposes. We performed the experiments in two sub-signals: the first was the moment of the maximal peak (MP) of the signal and the second is the swallowing apnea period (SAP). The OPF final accuracy obtained were 85.2% and 80.2% for the analyzed signals MP and SAP, respectively, outperforming the SVM results. ©2008 IEEE.

Infrared face recogniton by optimum-path forest

This paper presents a novel, fast and accurate appearance-based method for infrared face recognition. By introducing the Optimum-Path Forest classifier, our objective is to get good recognition rates and effectively reduce the computational effort. The feature extraction procedure is carried out by PCA, and the results are compared to two other well known supervised learning classifiers; Artificial Neural Networks and Support Vector Machines. The achieved performance asserts the promise of the proposed framework. ©2009 IEEE.

Fast non-technical losses identification through Optimum-Path Forest

Fraud detection in energy systems by illegal consumers is the most actively pursued study in non-technical losses by electric power companies. Commonly used supervised pattern recognition techniques, such as Artificial Neural Networks and Support Vector Machines have been applied for automatic commercial frauds identification, however they suffer from slow convergence and high computational burden. We introduced here the Optimum-Path Forest classifier for a fast non-technical losses recognition, which has been demonstrated to be superior than neural networks and similar to Support Vector Machines, but much faster. Comparisons among these classifiers are also presented. © 2009 IEEE.

Robust and fast vowel recognition using optimum-path forest

The applications of Automatic Vowel Recognition (AVR), which is a sub-part of fundamental importance in most of the speech processing systems, vary from automatic interpretation of spoken language to biometrics. State-of-the-art systems for AVR are based on traditional machine learning models such as Artificial Neural Networks (ANNs) and Support Vector Machines (SVMs), however, such classifiers can not deal with efficiency and effectiveness at the same time, existing a gap to be explored when real-time processing is required. In this work, we present an algorithm for AVR based on the Optimum-Path Forest (OPF), which is an emergent pattern recognition technique recently introduced in literature. Adopting a supervised training procedure and using speech tags from two public datasets, we observed that OPF has outperformed ANNs, SVMs, plus other classifiers, in terms of training time and accuracy. ©2010 IEEE.

Path formulation for multiparameter D3-equivariant bifurcation problems

We implement a singularity theory approach, the path formulation, to classify D3-equivariant bifurcation problems of corank 2, with one or two distinguished parameters, and their perturbations. The bifurcation diagrams are identified with sections over paths in the parameter space of a Ba-miniversal unfolding f0 of their cores. Equivalence between paths is given by diffeomorphisms liftable over the projection from the zero-set of F0 onto its unfolding parameter space. We apply our results to degenerate bifurcation of period-3 subharmonics in reversible systems, in particular in the 1:1-resonance.

Improving accuracy and speed of optimum-path forest classifier using combination of disjoint training subsets

The Optimum-Path Forest (OPF) classifier is a recent and promising method for pattern recognition, with a fast training algorithm and good accuracy results. Therefore, the investigation of a combining method for this kind of classifier can be important for many applications. In this paper we report a fast method to combine OPF-based classifiers trained with disjoint training subsets. Given a fixed number of subsets, the algorithm chooses random samples, without replacement, from the original training set. Each subset accuracy is improved by a learning procedure. The final decision is given by majority vote. Experiments with simulated and real data sets showed that the proposed combining method is more efficient and effective than naive approach provided some conditions. It was also showed that OPF training step runs faster for a series of small subsets than for the whole training set. The combining scheme was also designed to support parallel or distributed processing, speeding up the procedure even more. © 2011 Springer-Verlag.

A Markov random field model for combining optimum-path forest classifiers using decision graphs and game strategy approach

The research on multiple classifiers systems includes the creation of an ensemble of classifiers and the proper combination of the decisions. In order to combine the decisions given by classifiers, methods related to fixed rules and decision templates are often used. Therefore, the influence and relationship between classifier decisions are often not considered in the combination schemes. In this paper we propose a framework to combine classifiers using a decision graph under a random field model and a game strategy approach to obtain the final decision. The results of combining Optimum-Path Forest (OPF) classifiers using the proposed model are reported, obtaining good performance in experiments using simulated and real data sets. The results encourage the combination of OPF ensembles and the framework to design multiple classifier systems. © 2011 Springer-Verlag.

Image categorization through optimum path forest and visual words

Different from the first attempts to solve the image categorization problem (often based on global features), recently, several researchers have been tackling this research branch through a new vantage point - using features around locally invariant interest points and visual dictionaries. Although several advances have been done in the visual dictionaries literature in the past few years, a problem we still need to cope with is calculation of the number of representative words in the dictionary. Therefore, in this paper we introduce a new solution for automatically finding the number of visual words in an N-Way image categorization problem by means of supervised pattern classification based on optimum-path forest. © 2011 IEEE.

Intrusion detection system using optimum-path forest

Intrusion detection systems that make use of artificial intelligence techniques in order to improve effectiveness have been actively pursued in the last decade. Neural networks and Support Vector Machines have been also extensively applied to this task. However, their complexity to learn new attacks has become very expensive, making them inviable for a real time retraining. In this research, we introduce a new pattern classifier named Optimum-Path Forest (OPF) to this task, which has demonstrated to be similar to the state-of-the-art pattern recognition techniques, but extremely more efficient for training patterns. Experiments on public datasets showed that OPF classifier may be a suitable tool to detect intrusions on computer networks, as well as allow the algorithm to learn new attacks faster than the other techniques. © 2011 IEEE.