Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Dimensionality reduction using genetic algorithms
2000618 citationsWilliam F. Punch, Erik D. Goodman et al.profile →
Clustering ensembles: models of consensus and weak partitions
2005448 citationsA. Topchy, Anil K. Jain et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by William F. Punch
Since
Specialization
Citations
This map shows the geographic impact of William F. Punch's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by William F. Punch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites William F. Punch more than expected).
Fields of papers citing papers by William F. Punch
This network shows the impact of papers produced by William F. Punch. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by William F. Punch. The network helps show where William F. Punch may publish in the future.
Co-authorship network of co-authors of William F. Punch
This figure shows the co-authorship network connecting the top 25 collaborators of William F. Punch.
A scholar is included among the top collaborators of William F. Punch based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with William F. Punch. William F. Punch is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
DeMott, Jared D., Richard Enbody, & William F. Punch. (2011). Towards an automatic exploit pipeline. International Conference for Internet Technology and Secured Transactions. 323–329.4 indexed citations
Punch, William F. & Behrouz Minaei‐Bidgoli. (2005). Data mining for a web-based educational system.17 indexed citations
7.
Minaei‐Bidgoli, Behrouz, A. Topchy, & William F. Punch. (2004). A comparison of resampling methods for clustering ensembles. International Conference on Artificial Intelligence. 939–945.52 indexed citations
Topchy, A. & William F. Punch. (2001). Faster genetic programming based on local gradient search of numeric leaf values. Genetic and Evolutionary Computation Conference. 155–162.67 indexed citations
10.
Punch, William F. & William Rand. (2000). GP+Echo+subsumption = improved problem solving. Genetic and Evolutionary Computation Conference. 411–418.1 indexed citations
11.
Punch, William F., et al.. (1999). An approach to solving combinatorial optimization problems using a population of reinforcement learning agents. Genetic and Evolutionary Computation Conference. 1358–1365.15 indexed citations
Lin, Shyh-Chang, Erik D. Goodman, & William F. Punch. (1997). A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem.. 481–488.55 indexed citations
15.
Punch, William F., et al.. (1995). A Standard GA Approach to Native Protein Conformation Prediction. international conference on Genetic algorithms. 574–581.48 indexed citations
16.
Punch, William F., et al.. (1994). A Tool for Individualizing the Web.4 indexed citations
17.
Punch, William F., et al.. (1993). Further Research on Feature Selection and Classification Using Genetic Algorithms. international conference on Genetic algorithms. 557–564.167 indexed citations
Chandrasekaran, Bharath & William F. Punch. (1987). Data validation during diagnosis, a step beyond traditional sensor validation. National Conference on Artificial Intelligence. 778–782.13 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.