default search action
Douglas L. Steinley
Person information
- affiliation: University of Missouri, Columbia, MO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Michael J. Brusco, Douglas L. Steinley, Ashley L. Watts:
A maximal-clique-based set-covering approach to overlapping community detection. Optim. Lett. 18(6): 1491-1510 (2024) - 2023
- [j33]Iven Van Mechelen, Anne-Laure Boulesteix, Rainer Dangl, Nema Dean, Christian Hennig, Friedrich Leisch, Douglas L. Steinley, Matthijs J. Warrens:
A white paper on good research practices in benchmarking: The case of cluster analysis. WIREs Data. Mining. Knowl. Discov. 13(6) (2023) - 2022
- [j32]Michael J. Brusco, Douglas L. Steinley:
A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data. Optim. Lett. 16(1): 153-174 (2022) - 2020
- [j31]Douglas L. Steinley:
Editorial: Journal of Classification Vol. 37-1. J. Classif. 37(1): 1-3 (2020) - [j30]Paul D. McNicholas, Douglas L. Steinley:
Editorial: Journal of Classification Vol. 37-2. J. Classif. 37(2): 275-276 (2020)
2010 – 2019
- 2019
- [j29]Douglas L. Steinley:
Editorial: Journal of Classification Vol 36-1. J. Classif. 36(1): 1-2 (2019) - [j28]Douglas L. Steinley:
Editorial: Journal of Classification Vol. 36-2. J. Classif. 36(2): 175-176 (2019) - [j27]Douglas L. Steinley:
Editorial: Journal of Classification Vol. 36-3. J. Classif. 36(3): 393-396 (2019) - [j26]Douglas L. Steinley, Michael J. Brusco:
Using an Iterative Reallocation Partitioning Algorithm to Verify Test Multidimensionality. J. Classif. 36(3): 397-413 (2019) - [j25]Michael J. Brusco, Clay M. Voorhees, Roger J. Calantone, Michael K. Brady, Douglas L. Steinley:
Integrating linear discriminant analysis, polynomial basis expansion, and genetic search for two-group classification. Commun. Stat. Simul. Comput. 48(6): 1623-1636 (2019) - [j24]Michael J. Brusco, Douglas L. Steinley, Hans-Friedrich Köhn:
Residual analysis for unidimensional scaling in the L2-norm. Commun. Stat. Simul. Comput. 48(7): 2210-2221 (2019) - 2018
- [j23]Douglas L. Steinley:
Editorial. J. Classif. 35(1): 1-4 (2018) - [j22]Douglas L. Steinley:
Editorial. J. Classif. 35(2): 195-197 (2018) - [j21]Douglas L. Steinley:
Editorial. J. Classif. 35(3): 391-393 (2018) - [j20]Michael J. Brusco, Hannah J. Stolze, Michaela Hoffman, Douglas L. Steinley, Patrick Doreian:
Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode KL-Median Heuristic. J. Soc. Struct. 19(1) (2018) - 2017
- [j19]Douglas L. Steinley:
Editorial. J. Classif. 34(2): 163-164 (2017) - 2016
- [j18]Douglas L. Steinley:
Editorial. J. Classif. 33(2): 167-170 (2016) - [j17]Douglas L. Steinley:
Editorial. J. Classif. 33(3): 327-330 (2016) - [j16]Kathleen M. Gates, Teague Rhine Henry, Doug Steinley, Damien A. Fair:
A Monte Carlo Evaluation of Weighted Community Detection Algorithms. Frontiers Neuroinformatics 10: 45 (2016) - 2015
- [j15]Douglas L. Steinley, Gretchen Hendrickson, Michael J. Brusco:
A Note on Maximizing the Agreement Between Partitions: A Stepwise Optimal Algorithm and Some Properties. J. Classif. 32(1): 114-126 (2015) - [j14]Joeri Hofmans, Eva Ceulemans, Douglas L. Steinley, Iven Van Mechelen:
On the Added Value of Bootstrap Analysis for K-Means Clustering. J. Classif. 32(2): 268-284 (2015) - [j13]Douglas L. Steinley:
Editorial. J. Classif. 32(3): 357-358 (2015) - [j12]Michael J. Brusco, Douglas L. Steinley:
Affinity Propagation and Uncapacitated Facility Location Problems. J. Classif. 32(3): 443-480 (2015) - [j11]Michaela Hoffman, Douglas L. Steinley, Michael J. Brusco:
A note on using the adjusted Rand index for link prediction in networks. Soc. Networks 42: 72-79 (2015) - 2013
- [j10]Michael J. Brusco, Hans-Friedrich Köhn, Douglas L. Steinley:
Exact and approximate methods for a one-dimensional minimax bin-packing problem. Ann. Oper. Res. 206(1): 611-626 (2013) - [j9]Michael J. Brusco, Patrick Doreian, Paulette Lloyd, Douglas L. Steinley:
A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis. Netw. Sci. 1(2): 191-212 (2013) - 2011
- [j8]Michael J. Brusco, Douglas L. Steinley:
Exact and approximate algorithms for variable selection in linear discriminant analysis. Comput. Stat. Data Anal. 55(1): 123-131 (2011) - [j7]Douglas L. Steinley, Stanley Wasserman:
Introduction: special issue of statistical analysis and data mining on networks. Stat. Anal. Data Min. 4(5): 459-460 (2011) - [j6]Douglas L. Steinley, Michael J. Brusco, Stanley Wasserman:
Clusterwise p* models for social network analysis. Stat. Anal. Data Min. 4(5): 487-496 (2011)
2000 – 2009
- 2009
- [j5]Michael J. Brusco, Douglas L. Steinley, J. Dennis Cradit:
An Exact Algorithm for Hierarchically Well-Formulated Subsets in Second-Order Polynomial Regression. Technometrics 51(3): 306-315 (2009) - 2008
- [j4]Michael J. Brusco, Douglas L. Steinley:
A Binary Integer Program to Maximize the Agreement Between Partitions. J. Classif. 25(2): 185-193 (2008) - 2007
- [j3]Douglas L. Steinley, Michael J. Brusco:
Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques. J. Classif. 24(1): 99-121 (2007) - 2006
- [j2]Douglas L. Steinley:
A Review of Three Classification Society Meetings: 2001-2002. J. Classif. 23(1): 169-172 (2006) - [c1]Stanley Wasserman, Garry Robins, Douglas L. Steinley:
Statistical Models for Networks: A Brief Review of Some Recent Research. SNA@ICML 2006: 45-56 - 2005
- [j1]Douglas L. Steinley, Robert Henson:
OCLUS: An Analytic Method for Generating Clusters with Known Overlap. J. Classif. 22(2): 221-250 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint