Filters








7,766 Hits in 3.5 sec

Boosted Landmarks of Contextual Descriptors and Forest-ECOC: A novel framework to detect and classify objects in cluttered scenes

Sergio Escalera, Oriol Pujol, Petia Radeva
2007 Pattern Recognition Letters  
For this purpose, we extend the Error Correcting Output Codes technique proposing a methodology based on embedding a forest of optimal tree structures.  ...  We validated our approach using public data-sets from the UCI and Caltech databases.  ...  Our method and Dense Random ECOC use Gentle Adaboost with decision stumps as a classification technique to estimate the Forest-ECOC dichotomies, with T = 2 to generate and embed multiple trees.  ... 
doi:10.1016/j.patrec.2007.05.007 fatcat:spdqhzbpjrcm7oj3v2dwayhiui

A Hybrid Intelligent Approach for Network Intrusion Detection

Mrutyunjaya Panda, Ajith Abraham, Manas Ranjan Patra
2012 Procedia Engineering  
Experimental results on NSL-KDD dataset, an improved version of KDDCup 1999 dataset show that our proposed approach is efficient with high detection rate and low false alarm rate.  ...  However, these single classifier systems fail to provide the best possible attack detection rate with low false alarm rate.  ...  Finally, we conclude that our proposed hybridization of END with nested dichotomies and random forest of 10 trees with out of bag error of 0.06 results almost 100% intrusion detection rate with 0% false  ... 
doi:10.1016/j.proeng.2012.01.827 fatcat:ttfziakfijgstkgneimp23lm6e

Forest Extension of Error Correcting Output Codes and Boosted Landmarks

S. Escalera, O. Pujol, P. Radeva
2006 18th International Conference on Pattern Recognition (ICPR'06)  
We extend the ECOC technique proposing a methodology to construct a forest of decision trees that are included in the ECOC framework.  ...  We present very promising results on standard databases: UCI database and Caltech database as well as in a real image problem.  ...  Second, a new multiclass learning technique is introduced based on embedding a forest of optimal trees in an ECOC framework that allows to share features (tree nodes, base classifiers or dichotomies) in  ... 
doi:10.1109/icpr.2006.583 dblp:conf/icpr/EscaleraPR06 fatcat:xzu6ecmstjgsrgrxdqltdn6hqi

An Efficient Decision Tree Model for Classification of Attacks with Feature Selection

Akhilesh KumarShrivas, S. K. Singhai, H. S. Hota
2013 International Journal of Computer Applications  
Performance of the model with reduced feature subsets are also evaluated using other performance measures like true positive rate (TPR), false positive rate (FPR), precision, F-measure and receiver operating  ...  Due to high dimensionality of data set, ranking based feature selection technique is used to select critical features and to reduce unimportant features to be applied to deduct random forest model, which  ...  [8] have suggested hybrid technique with combination of random forest, dichotomies, and ensembles of balanced nested dichotomies (END) for binary class problem, which gives detection rate 99.50% and  ... 
doi:10.5120/14647-2967 fatcat:wvugaorem5fqbcjakbjxtp2beu

Application of Classifiers in Predicting Problems of Hydropower Engineering

Liming Huang
2018 Applied and Computational Mathematics  
For purpose of more precise results, numbers of trees and features are determined in advance before constructing the forest.  ...  This study compares performance of Random Forest, C4.5 and Naïve Bayes on the basis of accuracy, precision, recall and F-measure. It comes out that Random Forest is more suitable for this problem.  ...  It establishes a forest by combining different decision trees randomly, and there is no relationship among decision trees.  ... 
doi:10.11648/j.acm.20180703.19 fatcat:uk7ketjijbhbveno3telev66qy

Fault Diagnosis of Wind Turbine Blades using Histogram Features through Nested Dichotomy Classifiers

2019 International journal of recent technology and engineering  
Later, the selected feature is fed into the classifiers like Nested Dichotomy (ND), Class-Balanced Nested Dichotomies (CBND) and Data near Balanced Nested Dichotomy (DNBND) for classification of the faults  ...  Secondly, from the extracted feature, most dominating feature need to be chosen using J48 decision tree classifier.  ...  In Nested Dichotomy, the default classifier is fixed to be rotation forest algorithm. The confusion matrix of class-balanced nested dichotomy (CBND) is shown in Table 2 .  ... 
doi:10.35940/ijrte.b1032.0982s1119 fatcat:mjb4cilgpbfm5kf6hxdsd4ad3i

Predicting the Stock Price Movement by Social Media Analysis

Sitong Chen, Tianhong Gao, Yuqi He, Yifan Jin
2019 Journal of Data Analysis and Information Processing  
The approaches include Support vector machine, Logistic regression, Naive Bayesian, K-nearest neighbor classification, Decision tree, Random forest and Adaboost.  ...  model performances, 2) for positive and negative sentiments classifications, all classifiers reach at least 75% accuracy and the linear SVC models prove to perform best, 3) according to the strong correlation  ...  Without his help and encouragement, our thesis would have been impossible.  ... 
doi:10.4236/jdaip.2019.74017 fatcat:6o3mxedlaja77ksp7bytsvxiv4

Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP

Cornelius Brand, Holger Dell, Marc Roth
2018 Algorithmica  
Our main results are hardness results under #ETH for 1) the problem of counting all forests in a graph, that is, its acyclic subgraphs, and 2) the problem of counting the number of independent sets in  ...  Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time  ...  dichotomies" work group at the Simons Institute in the spring of 2016.  ... 
doi:10.1007/s00453-018-0472-z fatcat:i2ys5fwwkngxbmy557eybmtbti

Fine-grained dichotomies for the Tutte plane and Boolean #CSP [article]

Cornelius Brand, Holger Dell, Marc Roth
2016 arXiv   pre-print
Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time  ...  Another dichotomy theorem we strengthen is the one of Creignou and Hermann [6] for counting the number of satisfying assignments to a constraint satisfaction problem instance over the Boolean domain.  ...  other participants of the "dichotomies" work group at the Simons Institute in the spring of 2016.  ... 
arXiv:1606.06581v1 fatcat:ut6354ay3beuva7mnmg77352bu

Predicting the HMA-LMA Status in Marine Sponges by Machine Learning

Lucas Moitinho-Silva, Georg Steinert, Shaun Nielsen, Cristiane C. P. Hardoim, Yu-Chen Wu, Grace P. McCormack, Susanna López-Legentil, Roman Marchant, Nicole Webster, Torsten Thomas, Ute Hentschel
2017 Frontiers in Microbiology  
Among nine different classifiers, higher performances were achieved by Random Forest trained with phylum and class abundances.  ...  The dichotomy between high microbial abundance (HMA) and low microbial abundance (LMA) sponges has been observed in sponge-microbe symbiosis, although the extent of this pattern remains poorly unknown.  ...  (C) Performance of Random Forest (number of trees in the forest = 50) on classification of known HMA and LMA sponge species.  ... 
doi:10.3389/fmicb.2017.00752 pmid:28533766 pmcid:PMC5421222 fatcat:ks7wt5seozbjpbulv7tmxjbqx4

Comparing the Performance of Different Data Mining Techniques in Evaluating Loan Applications

Arash Riasi, Deshen Wang
2016 International Business Research  
The results indicated that the best data mining classifier for predicting whether a loan applicant will be approved or rejected is LAD Tree, followed by Rotation Forest, Logit Boost, Random Forest, and  ...  AD Tree.  ...  The meta classifiers which we used in this study are: Rotation Forest, Logit Boost, Ensemble of Nested Dichotomies (END), Nested Dichotomies (ND), Class Balance ND, Data Near Balance ND, Ordinal Class  ... 
doi:10.5539/ibr.v9n7p164 fatcat:glfuib6e4rb37lntzpvfmmemim

First-order query rewriting for inconsistent databases

Ariel Fuxman, Renée J. Miller
2007 Journal of computer and system sciences (Print)  
In contrast, in this paper we give an algorithm that computes the consistent answers for a large and practical class of conjunctive queries.  ...  We would like to thank Leonid Libkin, Marcelo Arenas, Pablo Barcelo, and Ken Pu for their comments and feedback.  ...  We say that q ∈ C tree if G is a forest (i.e., every connected component of G is a tree) and every non-key to key join of q is full.  ... 
doi:10.1016/j.jcss.2006.10.013 fatcat:ecyabmao4ncctot7e4qodwy52a

First-Order Query Rewriting for Inconsistent Databases [chapter]

Ariel D. Fuxman, Renée J. Miller
2004 Lecture Notes in Computer Science  
In contrast, in this paper we give an algorithm that computes the consistent answers for a large and practical class of conjunctive queries.  ...  We would like to thank Leonid Libkin, Marcelo Arenas, Pablo Barcelo, and Ken Pu for their comments and feedback.  ...  We say that q ∈ C tree if G is a forest (i.e., every connected component of G is a tree) and every non-key to key join of q is full.  ... 
doi:10.1007/978-3-540-30570-5_23 fatcat:snnu2sghyzavxbji2pgovypjye

Foreseeing Employee Attritions using Diverse Data Mining Strategies

2019 International journal of recent technology and engineering  
This paper incorporates and condenses the capacity to gain from information and give information-driven experiences, choice, and forecasts and thinks about significant machine learning systems that have  ...  This work has the potential for outlining better employee retention designs and enhancing employee contentment.  ...  Decision Tree 3. Random Forest and 4. AdaBoost algorithm (B)(I). Logistic Regression Logistic regression predicts the likelihood of a result which can have only two esteems (i.e. a dichotomy).  ... 
doi:10.35940/ijrte.b2406.098319 fatcat:vcjv2dfn4fb3rjrmv6lcy4o5zy

Environmental Policy and Public Opinion: a Note on Instrument Choice

Raphael Calel
2009 Opticon1826  
However, such a false equivalence would seem to fit well with the kind of moral dichotomy noted by Goeschl and Perino (2009) .  ...  If the price of harvesting these types of forest is the same, but the cost of harvesting virgin forest is lower (since there is no waiting time for the trees to be fully grown), the virgin forest would  ... 
doi:10.5334/opt.070909 fatcat:2qwdnpzyerd3dkvitf4e64qm2e
« Previous Showing results 1 — 15 out of 7,766 results