Luke K. McDowell
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Luke K. McDowell has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- David W. Aha
Navy Center for Applied Research in AI, Naval Research Laboratory (Code 5514), Washington, DC, USA
3 shared publications Aaron Fleming
U.S. Naval Academy
1 shared publication- David G. Underhill
Dept. Computer Science, U.S. Naval Academy, 572M Holloway Rd, Annapolis, MD 21402. (410) 293-6800
1 shared publication - David J. Marchette
Strategic and Computing Systems Department, Naval Surface Warfare Center Dahlgren Division, Dahlgren, VA 22448, USA
1 shared publication - Jeffrey L. Solka
Code Q20, NSWCDD, Dahlgren, VA 22448. (540) 653-1910
1 shared publication - Jennifer Neville
Purdue University and Microsoft Research USA
1 shared publication
Latest Publications
- 1 January 2015
- Published by Springer Nature
- p. 227-256
Evaluating and Extending Latent Methods for Link-Based Classification
- 1 January 2015
- Published by Springer Nature
- p. 227-256
Evaluating and Extending Latent Methods for Link-Based Classification
- 30 October 2012
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 45, 363-441
Transforming Graph Data for Statistical Relational Learning
- 30 October 2012
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 45, 363-441
Transforming Graph Data for Statistical Relational Learning
- Open Access
Semi-Supervised Collective Classification via Hybrid Label Regularization
Many classification problems involve data instances that are interlinked with each other, such as webpages connected by hyperlinks. Techniques for "collective classification" (CC) often increase accuracy for such data graphs, but usually require a fully-labeled training graph. In contrast, we examine how to improve the semi-supervised learning of CC models when given only a sparsely-labeled graph, a common situation. We first describe how to use novel combinations of classifiers to exploit the different characteristics of the relational features vs. the non-relational features. We also extend the ideas of "label regularization" to such hybrid classifiers, enabling them to leverage the unlabeled data to bias the learning process. We find that these techniques, which are efficient and easy to implement, significantly increase accuracy on three real datasets. In addition, our results explain conflicting findings from prior related studies.
Open AccessSemi-Supervised Collective Classification via Hybrid Label Regularization
Many classification problems involve data instances that are interlinked with each other, such as webpages connected by hyperlinks. Techniques for "collective classification" (CC) often increase accuracy for such data graphs, but usually require a fully-labeled training graph. In contrast, we examine how to improve the semi-supervised learning of CC models when given only a sparsely-labeled graph, a common situation. We first describe how to use novel combinations of classifiers to exploit the different characteristics of the relational features vs. the non-relational features. We also extend the ideas of "label regularization" to such hybrid classifiers, enabling them to leverage the unlabeled data to bias the learning process. We find that these techniques, which are efficient and easy to implement, significantly increase accuracy on three real datasets. In addition, our results explain conflicting findings from prior related studies.
- Open Access
Transforming Graph Representations for Statistical Relational Learning
Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of statistical relational learning (SRL) algorithms to these domains. In this article, we examine a range of representation issues for graph-based relational data. Since the choice of relational data representation for the nodes, links, and features can dramatically affect the capabilities of SRL algorithms, we survey approaches and opportunities for relational representation transformation designed to improve the performance of these algorithms. This leads us to introduce an intuitive taxonomy for data representation transformations in relational domains that incorporates link transformation and node transformation as symmetric representation tasks. In particular, the transformation tasks for both nodes and links include (i) predicting their existence, (ii) predicting their label or type, (iii) estimating their weight or importance, and (iv) systematically constructing their relevant features. We motivate our taxonomy through detailed examples and use it to survey and compare competing approaches for each of these tasks. We also discuss general conditions for transforming links, nodes, and features. Finally, we highlight challenges that remain to be addressed.
Open AccessTransforming Graph Representations for Statistical Relational Learning
Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of statistical relational learning (SRL) algorithms to these domains. In this article, we examine a range of representation issues for graph-based relational data. Since the choice of relational data representation for the nodes, links, and features can dramatically affect the capabilities of SRL algorithms, we survey approaches and opportunities for relational representation transformation designed to improve the performance of these algorithms. This leads us to introduce an intuitive taxonomy for data representation transformations in relational domains that incorporates link transformation and node transformation as symmetric representation tasks. In particular, the transformation tasks for both nodes and links include (i) predicting their existence, (ii) predicting their label or type, (iii) estimating their weight or importance, and (iv) systematically constructing their relevant features. We motivate our taxonomy through detailed examples and use it to survey and compare competing approaches for each of these tasks. We also discuss general conditions for transforming links, nodes, and features. Finally, we highlight challenges that remain to be addressed.
- 30 September 2008
- Published by Elsevier in Journal of Web Semantics
- Vol. 6 (3) , 218-236
Ontology-driven, unsupervised instance population
- 30 September 2008
- Published by Elsevier in Journal of Web Semantics
- Vol. 6 (3) , 218-236
Ontology-driven, unsupervised instance population
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 348-353
Enhancing Text Analysis via Dimensionality Reduction
Many applications require analyzing vast amounts of textual data, but the size and inherent noise of such data can make processing very challenging. One approach to these issues is to mathematically reduce the data so as to represent each document using only a few dimensions. Techniques for performing such "dimensionality reduction " (DR) have been well-studied for geometric and numerical data, but more rarely applied to text. In this paper, we examine the impact of five DR techniques on the accuracy of two supervised classifiers on three textual sources. This task mirrors important real world problems, such as classifying Web pages or scientific articles. In addition, the accuracy serves as a proxy measure for how well each DR technique preserves the inter-document relationships while vastly reducing the size of the data, facilitating more sophisticated analysis. We show that, for a fixed number of dimensions, DR can be very successful at improving accuracy compared to using the original words as features. Surprisingly, we also find that one of the simplest DR techniques, MDS, is among the most effective. This suggests that textual data may often lie upon a linear manifold where the more complex non-linear DR techniques do not have an advantage.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 348-353
Enhancing Text Analysis via Dimensionality Reduction
Many applications require analyzing vast amounts of textual data, but the size and inherent noise of such data can make processing very challenging. One approach to these issues is to mathematically reduce the data so as to represent each document using only a few dimensions. Techniques for performing such "dimensionality reduction " (DR) have been well-studied for geometric and numerical data, but more rarely applied to text. In this paper, we examine the impact of five DR techniques on the accuracy of two supervised classifiers on three textual sources. This task mirrors important real world problems, such as classifying Web pages or scientific articles. In addition, the accuracy serves as a proxy measure for how well each DR technique preserves the inter-document relationships while vastly reducing the size of the data, facilitating more sophisticated analysis. We show that, for a fixed number of dimensions, DR can be very successful at improving accuracy compared to using the original words as features. Surprisingly, we also find that one of the simplest DR techniques, MDS, is among the most effective. This suggests that textual data may often lie upon a linear manifold where the more complex non-linear DR techniques do not have an advantage.