Graph-based approach for airborne light detection and ranging segmentation
Journal of Applied Remote SensingPublished 10 March 2017Open access
D.L. Vilariño, José C. Cabaleiro, Jorge Martínez Sánchez, Francisco F. Rivera, Tomás F. Pena
Citations1,768
SJR quartileQ2
SJR score0.39
SNIP0.49
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A study of the performance/accuracy trade-off has been performed, extracting some conclusions about the benefits of the proposed solution and an interlaced graph-based approach is proposed to increase the reliability in general purpose segmentations.
Abstract
A graph-based segmentation technique has been tailored to segment airborne LiDAR points which, unlike images, are irregularly distributed. In our method, every LiDAR point is labeled as a node and interconnected as a graph extended to its neighborhood, defined in a 4-D feature space: the spatial coordinates (x,y,z) and the reflection intensity. The interconnections between pairs of neighboring nodes are weighted based on the distance in the feature space. The segmentation consists of an iterative process of classification of nodes into homogeneous groups based on their similarity. This approach is intended to be part of a complete system for the classification of structures from LiDAR point clouds in applications needing fast response times. In this sense, a study of the performance/accuracy trade-off has been performed, extracting some conclusions about the benefits of the proposed solution. In addition, an interlaced graph-based approach is proposed to increase the reliability in general purpose segmentations.
Keywords
Computer ScienceEarth and Planetary SciencesEnvironmental Science
Machine LearningRandom Forests
126,192 Citations2001Leo Breiman
Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the forest, and are also applicable to regression.
ACM Transactions on Intelligent Systems and TechnologyLIBSVM
41,340 Citations2011Chih-Chung Chang, Chih‐Jen Lin
Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
Springer series in statisticsThe Elements of Statistical Learning
24,344 Citations2001Trevor Hastie, J. Friedman +1 more
Statisctics and computing/Statistics and computingModern Applied Statistics with S
24,337 Citations2002W. N. Venables, B. D. Ripley
A guide to using S environments to perform statistical analyses providing both an introduction to the use of S and a course in modern statistical methods.
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Machine LearningInduction of Decision Trees
14,815 Citations1986J. R. Quinlan
This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail, which is described in detail.
PubMedRegularization Paths for Generalized Linear Models via Coordinate Descent.
13,977 Citations2010Jerome H. Friedman, Trevor Hastie +1 more
Neural Processing LettersLeast Squares Support Vector Machine Classifiers
9,375 Citations1999Johan A. K. Suykens, Joos Vandewalle
A least squares version for support vector machine (SVM) classifiers that follows from solving a set of linear equations, instead of quadratic programming for classical SVM's.
Journal of Statistical SoftwareBuilding Predictive Models in <i>R</i> Using the <b>caret</b> Package
9,252 Citations2008Max Kühn
The caret package, short for classification and regression training, contains numerous tools for developing predictive models using the rich set of models available in R to simplify model training and tuning across a wide variety of modeling techniques.
The Annals of StatisticsMultivariate Adaptive Regression Splines
8,084 Citations1991Jerome H. Friedman
A new method is presented for flexible regression modeling of high dimensional data that takes the form of an expansion in product spline basis functions, where the number of basis functions as well as the parameters associated with each one are automatically determined by the data.
Experiments with a new boosting algorithm
7,585 Citations1996Yoav Freund, Robert E. Schapire
Neural NetworksStacked generalization
7,478 Citations1992David H. Wolpert
The conclusion is that for almost any real-world generalization problem one should use some version of stacked generalization to minimize the generalization error rate.
Communications of the ACMMultidimensional binary search trees used for associative searching
7,467 Citations1975Jon Bentley
The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
The Annals of StatisticsAdditive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)
6,842 Citations2000Jerome H. Friedman, Trevor Hastie +1 more
This work shows that this seemingly mysterious phenomenon of boosting can be understood in terms of well-known statistical principles, namely additive modeling and maximum likelihood, and develops more direct approximations and shows that they exhibit nearly identical results to boosting.
IEEE Transactions on Pattern Analysis and Machine IntelligenceThe random subspace method for constructing decision forests
6,737 Citations1998Tin Kam Ho
A method to construct a decision tree based classifier is proposed that maintains highest accuracy on training data and improves on generalization accuracy as it grows in complexity.
Applied Predictive Modeling
6,639 Citations2013Max Kühn, Kjell Johnson
This research presents a novel and scalable approach called “Smartfitting” that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of designing and implementing statistical models for regression models.
LIBLINEAR: A Library for Large Linear Classification
6,625 Citations2008Rong-En Fan, Kai‐Wei Chang +3 more
Cambridge University Press eBooksPattern Recognition and Neural Networks
6,468 Citations1996B. D. Ripley
International Journal of Computer VisionEfficient Graph-Based Image Segmentation
6,198 Citations2004Pedro F. Felzenszwalb, Daniel P. Huttenlocher
An efficient segmentation algorithm is developed based on a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image and it is shown that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties.
Programs for Machine Learning
5,794 Citations1994Steven L. Salzberg, Alberto M. Segre
In his new book, C4.5: Programs for Machine Learning, Quinlan has put together a definitive, much needed description of his complete system, including the latest developments, which will be a welcome addition to the library of many researchers and students.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Extreme Learning Machine for Regression and Multiclass Classification
5,493 Citations2011Guang-Bin Huang, Hongming Zhou +2 more
ELM provides a unified learning platform with a widespread type of feature mappings and can be applied in regression and multiclass classification applications directly and in theory, ELM can approximate any target continuous function and classify any disjoint regions.
The MIT Press eBooksFast Training of Support Vector Machines Using Sequential Minimal Optimization
5,462 Citations1998John Platt
IEEE Transactions on Pattern Analysis and Machine IntelligenceOn combining classifiers
5,227 Citations1998Josef Kittler, M. Hatef +2 more
TechnometricsHandbook of Parametric and Nonparametric Statistical Procedures
4,697 Citations2004
This handbook provides you with everything you need to know about parametric and nonparametric statistical procedures, and helps you choose the best test for your data, interpret the results, and better evaluate the research of others.
Machine LearningInstance-Based Learning Algorithms
4,117 Citations1991David W. Aha, Dennis Kibler +1 more
This paper describes how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy and extends the nearest neighbor algorithm, which has large storage requirements.
Elsevier eBooksFast Effective Rule Induction
3,767 Citations1995William W. Cohen
This paper evaluates the recently-proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems, and proposes a number of modifications resulting in an algorithm RIPPERk that is very competitive with C4.5 and C 4.5rules with respect to error rates, but much more efficient on large samples.
Neural NetworksProbabilistic neural networks
3,738 Citations1990Donald F. Specht
A probabilistic neural network that can compute nonlinear decision boundaries which approach the Bayes optimal is formed, and a fourlayer neural network of the type proposed can map any input pattern to any number of classifications.
IEEE Computational Science and EngineeringOpenMP: an industry standard API for shared-memory programming
3,276 Citations1998Leonardo Dagum, Ramesh Menon
At its most elemental level, OpenMP is a set of compiler directives and callable runtime library routines that extend Fortran (and separately, C and C++ to express shared memory parallelism) and leaves the base language unspecified.
Proceedings of the National Academy of SciencesDiagnosis of multiple cancer types by shrunken centroids of gene expression
2,947 Citations2002Robert Tibshirani, Trevor Hastie +2 more
The method of “nearest shrunken centroids” identifies subsets of genes that best characterize each class, which was highly efficient in finding genes for classifying small round blue cell tumors and leukemias.
arXiv (Cornell University)Estimating Continuous Distributions in Bayesian Classifiers
2,925 Citations2013George H. John, Pat Langley
Journal of the American Statistical AssociationAn Introduction to Generalized Linear Models.
2,548 Citations1991Potter C. Chang, Annette J. Dobson
Journal of the American Statistical AssociationRegularized Discriminant Analysis
2,238 Citations1989Jerome H. Friedman
Alternatives to the usual maximum likelihood estimates for the covariance matrices are proposed, characterized by two parameters, the values of which are customized to individual situations by jointly minimizing a sample-based estimate of future misclassification risk.
arXiv (Cornell University)Assessing agreement on classification tasks: the kappa statistic
2,092 Citations1996Jean Carletta
IEEE Transactions on Pattern Analysis and Machine IntelligenceRotation Forest: A New Classifier Ensemble Method
1,877 Citations2006Juan J. Rodríguez, Ludmila I. Kuncheva +1 more
This work examined the rotation forest ensemble on a random selection of 33 benchmark data sets from the UCI repository and compared it with bagging, AdaBoost, and random forest and prompted an investigation into diversity-accuracy landscape of the ensemble models.
Chemometrics and Intelligent Laboratory SystemsSIMPLS: An alternative approach to partial least squares regression
1,877 Citations1993Sijmen de Jong
Machine LearningVery Simple Classification Rules Perform Well on Most Commonly Used Datasets
1,798 Citations1993Robert C. Holte
On most datasets studied, the best of very simple rules that classify examples on the basis of a single attribute is as accurate as the rules induced by the majority of machine learning systems.
Journal of the Royal Statistical Society Series C (Applied Statistics)Ridge Estimators in Logistic Regression
1,706 Citations1992Saskia le Cessie, Hans C. van Houwelingen
It is shown how ridge estimators can be used in logistic regression to improve the parameter estimates and to diminish the error made by further predictions and to predict new observations more accurately.
Neural ComputationThe Lack of A Priori Distinctions Between Learning Algorithms
1,646 Citations1996David H. Wolpert
It is shown that one cannot say: if empirical misclassification rate is low, the Vapnik-Chervonenkis dimension of your generalizer is small, and the training set is large, then with high probability your OTS error is small.
IEEE Transactions on Pattern Analysis and Machine IntelligenceScalable Nearest Neighbor Algorithms for High Dimensional Data
1,415 Citations2014Marius Muja, David Lowe
It is shown that the optimal nearest neighbor algorithm and its parameters depend on the data set characteristics and an automated configuration procedure for finding the best algorithm to search a particular data set is described.
A WEAKLY INFORMATIVE DEFAULT PRIOR DISTRIBUTION FOR LOGISTIC AND OTHER REGRESSION MODELS
1,395 Citations2009Andrew Gelman, Aleks Jakulin +1 more
Machine LearningLearning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
1,376 Citations1988Nick Littlestone
This work presents one such algorithm that learns disjunctive Boolean functions, along with variants for learning other classes of Boolean functions.
Scaling up the accuracy of Naive-Bayes classifiers: a decision-tree hybrid
1,363 Citations1996Ron Kohavi
A new algorithm, NBTree, is proposed, which induces a hybrid of decision-tree classifiers and Naive-Bayes classifiers: the decision-Tree nodes contain univariate splits as regular decision-trees, but the leaves contain Naïve-Bayesian classifiers.
MetaCost
1,294 Citations1999Pedro Domingos
A principled method for making an arbitrary classifier cost-sensitive by wrapping a cost-minimizing procedure around it is proposed, called MetaCost, which treats the underlying classifier as a black box, requiring no knowledge of its functioning or change to it.
Research Commons (The University of Waikato)Generating Accurate Rule Sets Without Global Optimization
1,284 Citations1998Eibe Frank, Ian H. Witten
This paper presents an algorithm for inferring rules by repeatedly generating partial decision trees, thus combining the two major paradigms for rule generation—creating rules from decision trees and the separate-and-conquer rule-learning technique.
Machine LearningLogistic Model Trees
1,218 Citations2005Niels Landwehr, Mark Hall +1 more
This paper uses a stagewise fitting process to construct the logistic regression models that can select relevant attributes in the data in a natural way, and shows how this approach can be used to build the logistics regression models at the leaves by incrementally refining those constructed at higher levels in the tree.
Large margin classification using the perceptron algorithm
1,099 Citations1998Yoav Freund, Robert E. Schapire
Journal of the Royal Statistical Society Series B (Statistical Methodology)Sparse Partial Least Squares Regression for Simultaneous Dimension Reduction and Variable Selection
904 Citations2010Hyonho Chun, Sündüz Keleş
This work provides an efficient implementation of sparse partial least squares regression and compares it with well‐known variable selection and dimension reduction approaches via simulation experiments and illustrates the practical utility in a joint analysis of gene expression and genomewide binding data.
Journal of the American Statistical AssociationFlexible Discriminant Analysis by Optimal Scoring
825 Citations1994Trevor Hastie, Robert Tibshirani +1 more
Nonparametric versions of discriminant analysis are obtained by replacing linear regression by any nonparametric regression method so that any multiresponse regression technique can be postprocessed to improve its classification performance.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Discriminant Analysis by Gaussian Mixtures
819 Citations1996Trevor Hastie, Robert Tibshirani
This paper fits Gaussian mixtures to each class to facilitate effective classification in non-normal settings, especially when the classes are clustered.
Elsevier eBooksK*: An Instance-based Learner Using an Entropic Distance Measure
752 Citations1995John G. Cleary, Leonard E. Trigg
K*, an instance-based learner that uses entropy as a distance measure, is described, and results that compare favourably with several machine learning algorithms are presented.
The Alternating Decision Tree Learning Algorithm
715 Citations1999Yoav Freund, Llew Mason
A new type of classi cation rule, the alternating decision tree, which is a generalization of decision trees, voted decision trees and voted decision stumps and generates rules that are usually smaller in size and thus easier to interpret.
Machine LearningNot So Naive Bayes: Aggregating One-Dependence Estimators
714 Citations2005Geoffrey I. Webb, Janice R. Boughton +1 more
A new approach to weakening the attribute independence assumption by averaging all of a constrained class of classifiers is presented, which delivers comparable prediction accuracy to LBR and Super-Parent TAN with substantially improved computational efficiency at test timerelative to the former and at training time relative to the latter.
Lecture notes in computer scienceThe power of decision tables
707 Citations1995Ron Kohavi
Experimental results show that on artificial and real-world domains containing only discrete features, IDTM, an algorithm inducing decision tables, can sometimes outperform state-of-the-art algorithms such as C4.5.
IEEE Transactions on Pattern Analysis and Machine IntelligenceComplexity measures of supervised classification problems
701 Citations2002Tin Kam Ho, Mitra Basu
A set of real-world problems to random labelings of points is compared and it is found that real problems contain structures in this measurement space that are significantly different from the random sets.
Machine LearningMultiBoosting: A Technique for Combining Boosting and Wagging
699 Citations2000Geoffrey I. Webb
MultiBoosting is an extension to the highly successful AdaBoost technique for forming decision committees that is able to harness both AdaBoost's high bias and variance reduction with wagging's superior variance reduction.
International Journal of Man-Machine StudiesPRISM: An algorithm for inducing modular rules
652 Citations1987Jadzia Cendrowska
A new algorithm is described, PRISM, which, although based on ID3, uses a different induction strategy to induce rules which are modular, thus avoiding many of the problems associated with decision trees.
Lecture notes in computer scienceA Simple Approach to Ordinal Classification
578 Citations2001Eibe Frank, Mark Hall
This paper presents a simple method that enables standard classification algorithms to make use of ordering information in class attributes and shows that it outperforms the naive approach, which treats the class values as an unordered set.
TechnometricsSparse Discriminant Analysis
544 Citations2011Line Katrine Harder Clemmensen, Trevor Hastie +2 more
This work proposes sparse discriminant analysis, a method for performing linear discriminant analysis with a sparseness criterion imposed such that classification and feature selection are performed simultaneously in the high-dimensional setting.
Photogrammetrie - Fernerkundung - GeoinformationThe DGPF-Test on Digital Airborne Camera Evaluation Overview and Test Design
417 Citations2010Michael Cramer
Der DGPF-Test zur Evaluation digitaler Luftbildkameras – Uberblick and Testdesign werden in separaten Beitragen vorgestellt, die ebenfalls Bestandteil dieser Ausgabe der Zeitschrift sind.
IEEE Transactions on Geoscience and Remote SensingSegmentation and Reconstruction of Polyhedral Building Roofs From Aerial Lidar Point Clouds
407 Citations2009Aparajithan Sampath, Jie Shan
An extended boundary regularization approach is developed based on multiple parallel and perpendicular line pairs to achieve topologically consistent and geometrically correct building models.
Journal of Statistical SoftwareAn Object-Oriented Framework for Robust Multivariate Analysis
403 Citations2009Valentin Todorov, Peter Filzmoser
The framework resides in the packages robustbase and rrcov and includes an almost complete set of algorithms for computing robust multivariate location and scatter, various robust methods for principal component analysis as well as robust linear and quadratic discriminant analysis.
Journal of ChemometricsImproved PLS algorithms
398 Citations1997Bhupinder S. Dayal, John F. MacGregor
A proof is given that only one of either the X‐ or the Y‐matrix in PLS algorithms needs to be deflated during the sequential process of computing latent vectors.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Penalized Classification using Fisher’s Linear Discriminant
394 Citations2011Daniela Witten, Robert Tibshirani
This work proposes penalized LDA, which is a general approach for penalizing the discriminant vectors in Fisher's discriminant problem in a way that leads to greater interpretability, and uses a minorization–maximization approach to optimize it efficiently when convex penalties are applied to the discriminating vectors.
Machine LearningUsing Model Trees for Classification
376 Citations1998Eibe Frank, Yong Wang +3 more
Surprisingly, using this simple transformation the model tree inducer M5′, based on Quinlan's M5, generates more accurate classifiers than the state-of-the-art decision tree learner C5.0, particularly when most of the attributes are numeric.
Min-cut based segmentation of point clouds
293 Citations2009Aleksey Golovinskiy, Thomas F. Funk
This work presents a min-cut based method of segmenting objects in point clouds that builds a k-nearest neighbors graph, assumes a background prior, adds hard foreground constraints, and finds the min- cut to compute a foreground-background segmentation.
Information FusionCreating diversity in ensembles using artificial data
292 Citations2004Prem Melville, Raymond J. Mooney
A new method for generating ensembles, D ecorate (Diverse Ensemble Creation by Oppositional Relabeling of Artificial Training Examples), that directly constructs diverse hypotheses using additional artificially constructed training examples is presented.
Hough-Transform and Extended RANSAC Algorithms for Automatic Detection of 3D Building Roof Planes from Lidar Data
286 Citations2007Fayez Tarsha Kurdi, Tania Landes +1 more
The proposed extension of RANSAC algorithm allows harmonizing the mathematical aspect of the algorithm with the geometry of a roof, and it is shown that the extended approach provides very satisfying results, even in the case of very weak point density and for different levels of building complexity.
arXiv (Cornell University)Locally Weighted Naive Bayes
275 Citations2012Eibe Frank, Mark Hall +1 more
Lecture notes in computer scienceGenerating Rule Sets from Model Trees
250 Citations1999Geoffrey Holmes, Mark Hall +1 more
This paper presents an algorithm for inducing simple, accurate decision lists from model trees and shows that this method produces comparably accurate and smaller rule sets than the commercial state-of-the-art rule learning system Cubist.
Machine LearningLazy Learning of Bayesian Rules
249 Citations2000Zijian Zheng, Geoffrey I. Webb
This paper proposes the application of lazy learning techniques to Bayesian tree induction and presents the resulting lazy Bayesian rule learning algorithm, called LBR, which can be justified by a variant of Bayes theorem which supports a weaker conditional attribute independence assumption than is required by naive Bayes.
Journal of Intelligent Information SystemsInduction of ripple-down rules applied to modeling large databases
233 Citations1995Brian R. Gaines, Paul Compton
A methodology for the modeling of large data sets is described which results in rule sets having minimal inter-rule interactions, and being simply maintained.
Chemometrics and Intelligent Laboratory SystemsSupervised Kohonen networks for classification problems
214 Citations2006W.J. Melssen, Ron Wehrens +1 more
This study focuses solely on multi-output classification problems and investigated the influence of two similarity measures applied to the output maps: the Euclidean and the Tanimoto distance.
Research Commons (The University of Waikato)Stacking Bagged and Dagged Models
203 Citations1997Kai Ming Ting, Ian H. Witten
It is demonstrated that bag-stack and dag-stacking can be eeective for classiication tasks even when the training samples cover just a small fraction of the full dataset, as well as diierent algorithms.
Neural ComputationVariational Bayesian Multinomial Probit Regression with Gaussian Process Priors
198 Citations2006Mark Girolami, Simon Rogers
This is the first time that a fully variational Bayesian treatment for multiclass GP classification has been developed without having to resort to additional explicit approximations to the nongaussian likelihood term.
Journal of Computational and Graphical StatisticsThe Design and Analysis of Benchmark Experiments
189 Citations2005Torsten Hothorn, Friedrich Leisch +2 more
A theoretical framework for inference problems in benchmark experiments is introduced and it is shown that standard statistical test procedures can be used to test for differences in the performances.
Neural NetworksA learning rule for very simple universal approximators consisting of a single layer of perceptrons
179 Citations2008Peter Auer, Harald Burgsteiner +1 more
The p-delta rule is exhibited, which is a biologically more realistic alternative to backprop in biological neural circuits, but also for implementations in special purpose hardware and it is shown that its performance is competitive with that of other learning approaches from neural networks and machine learning.
Feature selection via regularized trees
144 Citations2012Houtao Deng, George C. Runger
A tree regularization framework is proposed, which enables many tree models to perform feature selection efficiently and provides an effective and efficient feature selection solution for many practical problems.
Lecture notes in computer scienceClassification by Voting Feature Intervals
144 Citations1997Gülşen Demiröz, H. Altay Güvenir
Experiments on real-world datasets show that VFI achieves comparably and even better than NBC in terms of classification accuracy and is faster than NBC on all datasets.
Research Commons (University of Waikato)Combining Naive Bayes and Decision Tables
125 Citations2008Mark A. Hall, Eibe Frank
A simple semi-naive Bayesian ranking method that combines naive Bayes with induction of decision tables is investigated and it is shown that the resulting ranker, compared to either component technique, frequently significantly increases AUC.
Lecture notes in computer scienceAn Evaluation of Grading Classifiers
122 Citations2001Alexander K. Seewald, Johannes Fürnkranz
G grading is discussed, a meta-classification technique that tries to identify and correct incorrect predictions at the base level that may be viewed as a generalization of selection by cross-validation and therefore fills a conceptual gap in the space of meta- classification schemes.
Ensembles of nested dichotomies for multi-class problems
118 Citations2004Eibe Frank, Stefan Krämer
Ensembles of nested dichotomies appear to be a good general-purpose method for applying binary classifiers to multi-class problems and are preferable if logistic regression is used, and comparable in the case of C4.5.
KOPS (University of Konstanz)Boosting the Performance of RBF Networks with Dynamic Decay Adjustment
118 Citations1994Michael R. Berthold, J. Diamond
The Dynamic Decay Adjustment (DDA) algorithm is introduced which utilizes the constructive nature of the P-RCE algorithm together with independent adaptation of each prototype's decay factor and is class dependent and distinguishes between different neighbours.
Photogrammetric Engineering & Remote SensingNeighborhood Systems for Airborne Laser Data
106 Citations2005Sagi Filin, Norbert Pfeifer
The type of neighborhood that is established by the proposed systems is demonstrated, and it is shown that artifacts that are usually created by the common neighborhoods are avoided here, and that structures within the data that areusually masked are revealed.
Journal of Computational and Graphical StatisticsClassification Using Generalized Partial Least Squares
99 Citations2005Beiying Ding, Robert Gentleman
This work extends partial least squares (PLS), a popular dimension reduction tool in chemometrics, in the context of generalized linear regression, based on a previous approach, iteratively reweightedpartial least squares, that is, IRWPLS, and shows that by phrasing the problem in a generalized linear model setting and by applying Firth's procedure to avoid (quasi)separation, one gets lower classification error rates.
Open Repository and Bibliography (University of Luxembourg)HDclassif: An R Package for Model-Based Clustering and Discriminant Analysis of High-Dimensional Data
90 Citations2012Laurent Bergé, Charles Bouveyron +1 more
Machine LearningExperiment databases
84 Citations2012Joaquin Vanschoren, Hendrik Blockeel +2 more
This paper presents a collaboration framework designed to easily share machine learning experiments with the community, and automatically organize them in public databases, and describes how such an experiment database is designed, currently holding over 650,000 classification experiments.
The Annals of StatisticsMultivariate tests based on left-spherically distributed linear scores
74 Citations1998Ekkehard Glimm, Siegfried Kropf +1 more
Information SciencesTowards UCI+: A mindful repository design
64 Citations2013Núria Macià, Ester Bernadó-Mansilla
The study recommends the design of a mindful data repository, UCI+, which should include a set of properly characterised data sets consisting of a complete and representative sample of real-world problems, enriched with artificial benchmarks.
Pattern RecognitionExhaustive comparison of colour texture features and classification methods to discriminate cells categories in histological images of fish ovary
60 Citations2013E. González-Rufino, P. Carrión +3 more
An exhaustive statistical evaluation of a very wide variety of parallel and integrative texture analysis strategies, giving a total of 126 different feature vectors, and a selection of 17 classifiers, representative of the currently available classification techniques, was used to classify cells according to the presence/absence of nucleous and their stage of development.
Neural NetworksDirect Kernel Perceptron (DKP): Ultra-fast kernel ELM-based classification with non-iterative closed-form weight calculation
57 Citations2013Manuel Fernández-Delgado, Eva Cernadas +3 more
The linear DKP is extremely efficient and much faster than 12 very popular and accurate classifiers, exhibiting small differences with respect to the best ones (SVM, ELM, Adaboost and Random Forest), which are much slower.
International Advances in Economic ResearchMulticlass Corporate Failure Prediction by Adaboost.M1
57 Citations2007Esteban Alfaro, Matías Gámez +1 more
The Adaboost.M1 algorithm is applied to improve the accuracy of a classification tree in a multiclass corporate failure prediction problem using a set of European firms and novel discerning measures are introduced to rank independent variables in a generic classification task.
Pattern RecognitionLearner excellence biased by data set selection: A case for data characterisation and artificial data sets
43 Citations2012Núria Macià, Ester Bernadó-Mansilla +2 more
This work proposes the characterisation of data sets using complexity measures, which can be helpful for both guiding experimental design and explaining the behaviour of learners.
Lecture notes in computer scienceRacing Committees for Large Datasets
22 Citations2002Eibe Frank, Geoffrey Holmes +2 more
The empirical results show that the accuracy of the resulting committee can vary significantly with the chunk size, and show that pruning is indeed crucial to make the method practical for large datasets in terms of running time and memory requirements.
Oxford University Research Archive (ORA) (University of Oxford)Fast growing and interpretable oblique trees via logistic regression models
21 Citations2009Alfred Kar Yin Truong
The focus of this thesis is to grow oblique trees in a fast and deterministic manner and to propose ways of making them more interpretable, as the proposed approach to finding oblique splits makes use of logistic regression, well-founded variable selection techniques are introduced to classification trees.
IEEE Transactions on Neural NetworksDirect Parallel Perceptrons (DPPs): Fast Analytical Calculation of the Parallel Perceptrons Weights With Margin Control for Classification Tasks
18 Citations2011Manuel Fernández-Delgado, Jorge Ribeiro +2 more
This paper proposes an analytical closed-form expression to calculate the PPs' weights for classification tasks, which directly calculates (without iterations) the weights using the training patterns and their desired outputs, without any search or numeric function optimization.
Austrian Journal of StatisticsDomain-Based Benchmark Experiments: Exploratory and Inferential Analysis
15 Citations2016Manuel J. A. Eugster, Torsten Hothorn +1 more
This work extends the single data set-based approach to a joint analysis for the complete collection, the so called problem domain, to decide which algorithms to deploy in a specific application or to compare newly developed algorithms with well-known algorithms on established problem domains.
The international archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciencesMIN-CUT BASED SEGMENTATION OF AIRBORNE LIDAR POINT CLOUDS
15 Citations2012Serkan Ural, Jie Shan
Contour Clustering Analysis for Building Reconstruction from LIDAR Data
12 Citations2010Wanshou Jiang
The closeness of contours can effectively avoid the difficulty of edges grouping in conventional reconstruction methods; using contour cluster analysis can extract different hierarchical structures of the complex building; and even curved surface buildings can be correctly constructed using the method.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEA rule-based classification from a region-growing segmentation of airborne lidar
9 Citations2016Jorge Martínez Sánchez, Francisco F. Rivera +4 more
An object-based classification method for airborne LiDAR that distinguishes three main classes (buildings, vegetation and ground) based only onLiDAR information is presented.
…