John Hartigan

1972–2009

A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 54 researchers here, as inferred from the citation graph.

Whom John Hartigan trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Keith Ball

Who trusts John Hartigan overall

1. Chaopeng Shen
2. Sivaraman Balakrishnan
3. Hongyuan Zha
4. Sara Dolnicar
5. Inderjit S. Dhillon
6. Xinlei Chen
7. Deng Cai
8. Hans-Peter Kriegel
9. Yevgeny Seldin
10. Han Lin Shang

Papers from John Hartigan's perspective

Ordered by how strongly the researchers John Hartigan trusts endorse each paper. Same corpus, a different order for every researcher.

1. Interior-point polynomial algorithms in convex programming
2. The concentration of measure phenomenon
3. An elementary introduction to modern convex geometry, in flavors of geometry
4. Asymptotic estimates for the number of contingency tables, integer flows, and volumes of transportation polytopes
5. Hierarchical Grouping to Optimize an Objective Function
6. Brunn-Minkowski inequality
7. A refined Brunn-Minkowski inequality for convex sets
8. Some Inequalities Satisfied by the Quantities of Information of Fisher and Shannon
9. Fisher information inequalities and the central limit theorem
10. Entropy jumps in the presence of a spectral gap

Their papers

• Direct Clustering of a Data Matrix (1972)
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (2009) — 52 citations
• Fairness in Employment Testing: Validity Generalization, Minority Issues, and the General Aptitude Test Battery (1989)
• A k-means clustering algorithm (1979)