David W. Aha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
David W. Aha has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Kalyan Moy Gupta
Knexus Research Corp
2 shared publications - Philip Moore
ITT Industries
2 shared publications - Roy Ladner
Naval Meteorology and Oceanography Command
2 shared publications - Steven L. Salzberg
Center for Computational Biology, Johns Hopkins University , Baltimore, Maryland, USA
2 shared publications Brendan Morris
1 shared publication- Bryan Auslander
Knexus Research Corporation
1 shared publication
Latest Publications
- 1 January 2014
- Published by Defense Technical Information Center (DTIC)
Comparison of Object Detection Algorithms on Maritime Vessels
This manuscript conducts a comparison on modern object detection systems in their ability to detect multiple maritime vessel classes. Three highly scoring algorithms from the Pascal VOC Challenge, Histogram of Oriented Gradients by Dalal and Triggs, Exemplar-SVM by Malisiewicz, and Latent-SVM with Deformable Part Models by Felzenszwalb, were compared to determine performance of recognition within a specific category rather than the general classes from the original challenge. In all cases, the histogram of oriented edges was used as the feature set and support vector machines were used for classification. A summary and comparison of the learning algorithms is presented and a new image corpus of maritime vessels was collected. Precision-recall results show improved recognition performance is achieved when accounting for vessel pose. In particular, the deformable part model has the best performance when considering the various components of a maritime vessel.
- 1 January 2014
- Published by Defense Technical Information Center (DTIC)
Comparison of Object Detection Algorithms on Maritime Vessels
This manuscript conducts a comparison on modern object detection systems in their ability to detect multiple maritime vessel classes. Three highly scoring algorithms from the Pascal VOC Challenge, Histogram of Oriented Gradients by Dalal and Triggs, Exemplar-SVM by Malisiewicz, and Latent-SVM with Deformable Part Models by Felzenszwalb, were compared to determine performance of recognition within a specific category rather than the general classes from the original challenge. In all cases, the histogram of oriented edges was used as the feature set and support vector machines were used for classification. A summary and comparison of the learning algorithms is presented and a new image corpus of maritime vessels was collected. Precision-recall results show improved recognition performance is achieved when accounting for vessel pose. In particular, the deformable part model has the best performance when considering the various components of a maritime vessel.
- Open Access
- 23 March 2008
- Published by Defense Technical Information Center (DTIC)
The Long War and America's Relationship With Its Military
Collective classification can significantly improve accuracy by exploiting relationships among instances. Although several collective inference procedures have been reported they have not been thoroughly evaluated for their commonalities and differences. We introduce novel generalizations of three existing algorithms that allow such algorithmic and empirical comparisons. Our generalizations permit us to examine how cautiously or aggressively each algorithm exploits intermediate relational data, which can be noisy. We conjecture that cautious approaches that identify and preferentially exploit the more reliable intermediate data should outperform aggressive approaches. We explain why caution is useful and introduce three parameters to control the degree of caution. An empirical evaluation of collective classification algorithms, using two base classifiers on three data sets, supports our conjecture.
- 23 March 2008
- Published by Defense Technical Information Center (DTIC)
Open AccessThe Long War and America's Relationship With Its Military
Collective classification can significantly improve accuracy by exploiting relationships among instances. Although several collective inference procedures have been reported they have not been thoroughly evaluated for their commonalities and differences. We introduce novel generalizations of three existing algorithms that allow such algorithmic and empirical comparisons. Our generalizations permit us to examine how cautiously or aggressively each algorithm exploits intermediate relational data, which can be noisy. We conjecture that cautious approaches that identify and preferentially exploit the more reliable intermediate data should outperform aggressive approaches. We explain why caution is useful and introduce three parameters to control the degree of caution. An empirical evaluation of collective classification algorithms, using two base classifiers on three data sets, supports our conjecture.
- 31 January 2008
- Published by Springer Nature in Soft Computing
- Vol. 12 (11) , 1089-1098
Soft computing techniques for web services brokering
- 31 January 2008
- Published by Springer Nature in Soft Computing
- Vol. 12 (11) , 1089-1098
Soft computing techniques for web services brokering
- 5 May 2006
- Published by SPIE-Intl Soc Optical Eng
- Vol. 6201, 620117
Case-based classification alternatives to ontologies for automated web service discovery and integration
Web Services are becoming the standard technology used to share data for many Navy and other DoD operations. Since Web Services technologies provide for discoverable, self-describing services that conform to common standards, this paradigm holds the promise of an automated capability to obtain and integrate data. However, automated integration of applications to access and retrieve data from heterogeneous sources in a distributed system such as the Internet poses many difficulties. Assimilation of data from Web-based sources means that differences in schema and terminology prevent simple querying and retrieval of data. Thus, machine understanding of the Web Services interface is necessary for automated selection and invocation of the correct service. Service availability is also an issue that needs to be resolved. There have been many advances on ontologies to help resolve these difficulties to support the goal of sharing knowledge for various domains of interest. In this paper we examine the use of case-based classification as an alternative/supplement to using ontologies for resolving several questions related to knowledge sharing. While ontologies encompass a formal definition of a domain of interest, case-based reasoning is a problem solving methodology that retrieves and reuses decisions from stored cases to solve new problems, and case-based classification involves applying this methodology to classification tasks. Our approach generalizes well in sparse data, which characterizes our Web Services application. We present our study as it relates to our work on development of the Advanced MetOc Broker, whose objective is the automated application integration of meteorological and oceanographic (MetOc) Web Services.
- 5 May 2006
- Published by SPIE-Intl Soc Optical Eng
- Vol. 6201, 620117
Case-based classification alternatives to ontologies for automated web service discovery and integration
Web Services are becoming the standard technology used to share data for many Navy and other DoD operations. Since Web Services technologies provide for discoverable, self-describing services that conform to common standards, this paradigm holds the promise of an automated capability to obtain and integrate data. However, automated integration of applications to access and retrieve data from heterogeneous sources in a distributed system such as the Internet poses many difficulties. Assimilation of data from Web-based sources means that differences in schema and terminology prevent simple querying and retrieval of data. Thus, machine understanding of the Web Services interface is necessary for automated selection and invocation of the correct service. Service availability is also an issue that needs to be resolved. There have been many advances on ontologies to help resolve these difficulties to support the goal of sharing knowledge for various domains of interest. In this paper we examine the use of case-based classification as an alternative/supplement to using ontologies for resolving several questions related to knowledge sharing. While ontologies encompass a formal definition of a domain of interest, case-based reasoning is a problem solving methodology that retrieves and reuses decisions from stored cases to solve new problems, and case-based classification involves applying this methodology to classification tasks. Our approach generalizes well in sparse data, which characterizes our Web Services application. We present our study as it relates to our work on development of the Advanced MetOc Broker, whose objective is the automated application integration of meteorological and oceanographic (MetOc) Web Services.
- 1 March 2005
- Published by Maximum Academic Press in The Knowledge Engineering Review
- Vol. 20 (3) , 247-254
Advances in conversational case-based reasoning
A considerable amount of research in case-based reasoning (CBR) has recently focused on conversational CBR as a means of providing more effective support for interactive problem solving. We review progress made to date and identify challenges that remain to be addressed.
- 1 March 2005
- Published by Maximum Academic Press in The Knowledge Engineering Review
- Vol. 20 (3) , 247-254
Advances in conversational case-based reasoning
A considerable amount of research in case-based reasoning (CBR) has recently focused on conversational CBR as a means of providing more effective support for interactive problem solving. We review progress made to date and identify challenges that remain to be addressed.
- Open Access
- 10 February 2001
- Published by American Astronomical Society in The Astrophysical Journal
- Vol. 548 (1) , 219-223
Ensembles of Classifiers for Morphological Galaxy Classification
We compare the use of three algorithms for performing automated morphological galaxy classiÐcation using a sample of 800 galaxies. ClassiÐers are created using a single training set as well as bootstrap replicates of the training set, producing an ensemble of classiÐers. We use a Naive Bayes classiÐer, a neural network trained with backpropagation, and a decision-tree induction algorithm with pruning. Previous work in the Ðeld has emphasized backpropagation networks and decision trees. The Naive Bayes classiÐer is easy to understand and implement and often works remarkably well on real-world data. For each of these algorithms, we examine the classiÐcation accuracy of individual classiÐers using 10-fold cross validation and of ensembles of classiÐers trained using 25 bootstrap data sets and tested on the same cross-validation test sets. Our results show that (1) the neural network produced the best individual classiÐers (lowest classiÐcation error) for the majority of cases, (2) the ensemble approach signiÐcantly reduced the classiÐcation error for the neural network and the decision-tree classiÐers but not for the Naive Bayes classiÐer, (3) the ensemble approach worked better for decision trees (typical error reduction of 12%È23%) than for the neural network (typical error reduction of 7%È12%), and (4) the relative improvement when using ensembles decreases as the number of output classes increases. While more extensive comparisons are needed (e.g., a variety of data and classiÐers), our work is the Ðrst demonstration that the ensemble approach can signiÐcantly increase the performance of certain automated classiÐcation methods when applied to the domain of morphological galaxy classiÐcation.
- 10 February 2001
- Published by American Astronomical Society in The Astrophysical Journal
- Vol. 548 (1) , 219-223
Open AccessEnsembles of Classifiers for Morphological Galaxy Classification
We compare the use of three algorithms for performing automated morphological galaxy classiÐcation using a sample of 800 galaxies. ClassiÐers are created using a single training set as well as bootstrap replicates of the training set, producing an ensemble of classiÐers. We use a Naive Bayes classiÐer, a neural network trained with backpropagation, and a decision-tree induction algorithm with pruning. Previous work in the Ðeld has emphasized backpropagation networks and decision trees. The Naive Bayes classiÐer is easy to understand and implement and often works remarkably well on real-world data. For each of these algorithms, we examine the classiÐcation accuracy of individual classiÐers using 10-fold cross validation and of ensembles of classiÐers trained using 25 bootstrap data sets and tested on the same cross-validation test sets. Our results show that (1) the neural network produced the best individual classiÐers (lowest classiÐcation error) for the majority of cases, (2) the ensemble approach signiÐcantly reduced the classiÐcation error for the neural network and the decision-tree classiÐers but not for the Naive Bayes classiÐer, (3) the ensemble approach worked better for decision trees (typical error reduction of 12%È23%) than for the neural network (typical error reduction of 7%È12%), and (4) the relative improvement when using ensembles decreases as the number of output classes increases. While more extensive comparisons are needed (e.g., a variety of data and classiÐers), our work is the Ðrst demonstration that the ensemble approach can signiÐcantly increase the performance of certain automated classiÐcation methods when applied to the domain of morphological galaxy classiÐcation.
- 1 September 1998
- Published by Elsevier in Artificial Intelligence
- Vol. 104 (1-2) , 287-311
A probabilistic framework for memory-based reasoning
- 1 September 1998
- Published by Elsevier in Artificial Intelligence
- Vol. 104 (1-2) , 287-311
A probabilistic framework for memory-based reasoning
- 1 January 1997
- Published by Springer Nature
- p. 273-314
A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms
- 1 January 1997
- Published by Springer Nature
- p. 273-314
A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms
- 1 January 1996
- Published by Springer Nature
- p. 199-206
A Comparative Evaluation of Sequential Feature Selection Algorithms
- 1 January 1996
- Published by Springer Nature
- p. 199-206
A Comparative Evaluation of Sequential Feature Selection Algorithms