943 resultados para supervised neighbor embedding
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Relevance feedback approaches have been established as an important tool for interactive search, enabling users to express their needs. However, in view of the growth of multimedia collections available, the user efforts required by these methods tend to increase as well, demanding approaches for reducing the need of user interactions. In this context, this paper proposes a semi-supervised learning algorithm for relevance feedback to be used in image retrieval tasks. The proposed semi-supervised algorithm aims at using both supervised and unsupervised approaches simultaneously. While a supervised step is performed using the information collected from the user feedback, an unsupervised step exploits the intrinsic dataset structure, which is represented in terms of ranked lists of images. Several experiments were conducted for different image retrieval tasks involving shape, color, and texture descriptors and different datasets. The proposed approach was also evaluated on multimodal retrieval tasks, considering visual and textual descriptors. Experimental results demonstrate the effectiveness of the proposed approach.
Resumo:
Semi-supervised learning is one of the important topics in machine learning, concerning with pattern classification where only a small subset of data is labeled. In this paper, a new network-based (or graph-based) semi-supervised classification model is proposed. It employs a combined random-greedy walk of particles, with competition and cooperation mechanisms, to propagate class labels to the whole network. Due to the competition mechanism, the proposed model has a local label spreading fashion, i.e., each particle only visits a portion of nodes potentially belonging to it, while it is not allowed to visit those nodes definitely occupied by particles of other classes. In this way, a "divide-and-conquer" effect is naturally embedded in the model. As a result, the proposed model can achieve a good classification rate while exhibiting low computational complexity order in comparison to other network-based semi-supervised algorithms. Computer simulations carried out for synthetic and real-world data sets provide a numeric quantification of the performance of the method.
Resumo:
Semi-supervised learning techniques have gained increasing attention in the machine learning community, as a result of two main factors: (1) the available data is exponentially increasing; (2) the task of data labeling is cumbersome and expensive, involving human experts in the process. In this paper, we propose a network-based semi-supervised learning method inspired by the modularity greedy algorithm, which was originally applied for unsupervised learning. Changes have been made in the process of modularity maximization in a way to adapt the model to propagate labels throughout the network. Furthermore, a network reduction technique is introduced, as well as an extensive analysis of its impact on the network. Computer simulations are performed for artificial and real-world databases, providing a numerical quantitative basis for the performance of the proposed method.
Resumo:
The cost-effectiveness of a modified supervised toothbrushing program was compared to a conventional program. A total of 284 five-year-old children presenting at least one permanent molar with emerged/sound occlusal surface participated. In the control group, oral health education and dental plaque dying followed by toothbrushing with fluoride dentifrice was carried outfour times per year. With the test group, children also underwent professional cross-brushing on surfaces of first permanent molar rendered by a dental assistant five times per year. Enamel/dentin caries were recorded on buccal, occlusal and lingual surfaces of permanent molars for a period of 18 months. The incidence density (ID) ratio was estimated using Poisson's regression model. The ID was 50% lower among boys in the test group (p = 0.016). The cost of the modified program was US$ 1.79 per capita. The marginal cost-effectiveness ratio among boys was US$ 6.30 per avoided carie. The modified supervised toothbrushing program was shown to be cost-effective in the case of boys.
Resumo:
This study aimed to estimate the owned dog and cat populations of Sao Paulo city using a complex sample with random selection in two stages. In each administrative district, six census sectors and 20 households in each sampled sector were visited from September 2006 to September 2009, totalizing 11,272 interviews. The human: dog ratio was 4.34 and the human: cat ratio was 19.33. The dog population was 2,507,401 and the cat population, 562,965. The dog population was composted of 52.7% males, while among the cat population it was 45.1%. The proportion of sterilized females (23.4% among dogs and 46.1% among cats) was higher than males (11.4% among dogs and 31.5% among cats). The mean age of dogs was 4.99 years, and for cats, 3.53 years. The proportion of restricted (without access to the street) dogs, 64.4%, was higher than restricted cats, 42.5%. The average number of animals/household was 1.60 for dogs and 1.69 for cats. The animal ownership is associated with cultural factors, therefore the characterization of canine and feline population is essential to implement an adequate animal population management program and zoonosis control.
Resumo:
Solvent effects on the one- and two-photon absorption (IPA and 2PA) of disperse orange 3 (DO3) in dimethyl sulfoxide (DMSO) are studied using a discrete polarizable embedding (PE) response theory. The scheme comprises a quantum region containing the chromophore and an atomically granulated classical region for the solvent accounting for full interactions within and between the two regions. Either classical molecular dynamics (MD) or hybrid Car-Parrinello (CP) quantum/classical (QM/MM) molecular dynamics simulations are employed to describe the solvation of DO3 in DMSO, allowing for an analysis of the effect of the intermolecular short-range repulsion, long-range attraction, and electrostatic interactions on the conformational changes of the chromophore and also the effect of the solute-solvent polarization. PE linear response calculations are performed to verify the character, solvatochromic shift, and overlap of the two lowest energy transitions responsible for the linear absorption spectrum of DO3 in DMSO in the visible spectral region. Results of the PE linear and quadratic response calculations, performed using uncorrelated solute-solvent configurations sampled from either the classical or hybrid CP QM/MM MD simulations, are used to estimate the width of the line shape function of the two electronic lowest energy excited states, which allow a prediction of the 2PA cross-sections without the use of empirical parameters. Appropriate exchange-correlation functionals have been employed in order to describe the charge-transfer process following the electronic transitions of the chromophore in solution.
Resumo:
Dimensionality reduction is employed for visual data analysis as a way to obtaining reduced spaces for high dimensional data or to mapping data directly into 2D or 3D spaces. Although techniques have evolved to improve data segregation on reduced or visual spaces, they have limited capabilities for adjusting the results according to user's knowledge. In this paper, we propose a novel approach to handling both dimensionality reduction and visualization of high dimensional data, taking into account user's input. It employs Partial Least Squares (PLS), a statistical tool to perform retrieval of latent spaces focusing on the discriminability of the data. The method employs a training set for building a highly precise model that can then be applied to a much larger data set very effectively. The reduced data set can be exhibited using various existing visualization techniques. The training data is important to code user's knowledge into the loop. However, this work also devises a strategy for calculating PLS reduced spaces when no training data is available. The approach produces increasingly precise visual mappings as the user feeds back his or her knowledge and is capable of working with small and unbalanced training sets.
Resumo:
Abstract Background Low back pain is a relevant public health problem, being an important cause of work absenteeism worldwide, as well as affecting the quality of life of sufferers and their individual functional performances. Supervised active physical routines and of cognitive-behavioral therapies are recommended for the treatment of chronic Low back pain, although evidence to support the effectiveness of different techniques is missing. Accordingly, the aim of this study is to contrast the effectiveness of two types of exercises, graded activity or supervised, in decreasing symptoms of chronic low back pain. Methods/design Sample will consist of 66 patients, blindly allocated into one of two groups: 1) Graded activity which, based on an operant approach, will use time-contingent methods aiming to increase participants’ activity levels; 2) Supervised exercise, where participants will be trained for strengthening, stretching, and motor control targeting different muscle groups. Interventions will last one hour, and will happen twice a week for 6 weeks. Outcomes (pain, disability, quality of life, global perceived effect, return to work, physical activity, physical capacity, and kinesiophobia) will be assessed at baseline, at treatment end, and three and six months after treatment end. Data collection will be conducted by an investigator blinded to treatment allocation. Discussion This project describes the randomisation method that will be used to compare the effectiveness of two different treatments for chronic low back pain: graded activity and supervised exercises. Since optimal approach for patients with chronic back pain have yet not been defined based on evidence, good quality studies on the subject are necessary. Trial registration NCT01719276
Resumo:
Semi-supervised learning is a classification paradigm in which just a few labeled instances are available for the training process. To overcome this small amount of initial label information, the information provided by the unlabeled instances is also considered. In this paper, we propose a nature-inspired semi-supervised learning technique based on attraction forces. Instances are represented as points in a k-dimensional space, and the movement of data points is modeled as a dynamical system. As the system runs, data items with the same label cooperate with each other, and data items with different labels compete among them to attract unlabeled points by applying a specific force function. In this way, all unlabeled data items can be classified when the system reaches its stable state. Stability analysis for the proposed dynamical system is performed and some heuristics are proposed for parameter setting. Simulation results show that the proposed technique achieves good classification results on artificial data sets and is comparable to well-known semi-supervised techniques using benchmark data sets.
Resumo:
The strength and durability of materials produced from aggregates (e.g., concrete bricks, concrete, and ballast) are critically affected by the weathering of the particles, which is closely related to their mineral composition. It is possible to infer the degree of weathering from visual features derived from the surface of the aggregates. By using sound pattern recognition methods, this study shows that the characterization of the visual texture of particles, performed by using texture-related features of gray scale images, allows the effective differentiation between weathered and nonweathered aggregates. The selection of the most discriminative features is also performed by taking into account a feature ranking method. The evaluation of the methodology in the presence of noise suggests that it can be used in stone quarries for automatic detection of weathered materials.