D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 34 Citations 18,454 130 World Ranking 6246 National Ranking 3006
Mathematics D-index 31 Citations 10,419 106 World Ranking 1929 National Ranking 832

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Artificial intelligence
  • Geometry

David M. Mount spends much of his time researching Combinatorics, Discrete mathematics, Algorithm, k-nearest neighbors algorithm and Time complexity. His studies deal with areas such as Voronoi diagram and Visibility graph as well as Combinatorics. His studies in Algorithm integrate themes in fields like CURE data clustering algorithm, Data stream clustering and Canopy clustering algorithm.

His work carried out in the field of Data stream clustering brings together such families of science as Difference-map algorithm, k-medians clustering, FSA-Red Algorithm, Ramer–Douglas–Peucker algorithm and Affinity propagation. His Canopy clustering algorithm research incorporates themes from Clustering high-dimensional data, Data set and Pattern recognition. The study incorporates disciplines such as Ball tree, Fixed-radius near neighbors and Nearest neighbor search in addition to k-nearest neighbors algorithm.

His most cited work include:

  • An efficient k-means clustering algorithm: analysis and implementation (3971 citations)
  • An optimal algorithm for approximate nearest neighbor searching fixed dimensions (2063 citations)
  • An optimal algorithm for approximate nearest neighbor searching (606 citations)

What are the main themes of his work throughout his whole career to date?

David M. Mount mainly focuses on Combinatorics, Discrete mathematics, Algorithm, k-nearest neighbors algorithm and Upper and lower bounds. In his study, which falls under the umbrella issue of Combinatorics, Linear space is strongly linked to Bounded function. His Discrete mathematics research incorporates elements of Spanner and Range searching.

His study in Algorithm is interdisciplinary in nature, drawing from both Point, Mathematical optimization and Data structure. David M. Mount combines subjects such as Ball tree, Nearest neighbor search and Cover tree with his study of k-nearest neighbors algorithm. Within one scientific family, David M. Mount focuses on topics pertaining to Large margin nearest neighbor under Best bin first, and may sometimes address concerns connected to Fixed-radius near neighbors.

He most often published in these fields:

  • Combinatorics (45.83%)
  • Discrete mathematics (24.07%)
  • Algorithm (23.15%)

What were the highlights of his more recent work (between 2013-2021)?

  • Combinatorics (45.83%)
  • Polytope (8.33%)
  • k-nearest neighbors algorithm (14.35%)

In recent papers he was focusing on the following fields of study:

His primary areas of investigation include Combinatorics, Polytope, k-nearest neighbors algorithm, Convex body and Discrete mathematics. His Combinatorics study combines topics from a wide range of disciplines, such as Space and Point. His Point study also includes

  • Set which is related to area like Class,
  • Data structure which intersects with area such as Cluster analysis.

His Polytope research is multidisciplinary, relying on both Intersection, Upper and lower bounds and Convex polytope. The various areas that David M. Mount examines in his k-nearest neighbors algorithm study include Algorithm, Training set and Heuristics. Euclidean geometry is closely connected to Hausdorff distance in his research, which is encompassed under the umbrella topic of Convex body.

Between 2013 and 2021, his most popular works were:

  • On the Least Trimmed Squares Estimator (46 citations)
  • Computational Geometry: Proximity and Location (20 citations)
  • Optimal approximate polytope membership (12 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Artificial intelligence
  • Geometry

His primary areas of investigation include Polytope, Combinatorics, k-nearest neighbors algorithm, Convex body and Discrete mathematics. His Polytope research integrates issues from Intersection, Boundary and Convex polytope. The concepts of his Boundary study are interwoven with issues in Mahler volume, Approximation algorithm and Dimension.

David M. Mount applies his multidisciplinary studies on Combinatorics and k-minimum spanning tree in his research. David M. Mount has included themes like Classifier, Upper and lower bounds and Heuristics in his k-nearest neighbors algorithm study. His Upper and lower bounds study integrates concerns from other disciplines, such as Structure, Theoretical computer science, Quadtree, Point and Data structure.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

An efficient k-means clustering algorithm: analysis and implementation

T. Kanungo;D.M. Mount;N.S. Netanyahu;C.D. Piatko.
IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

5887 Citations

An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Sunil Arya;David M. Mount;Nathan S. Netanyahu;Ruth Silverman.
Journal of the ACM (1998)

3608 Citations

An optimal algorithm for approximate nearest neighbor searching

Sunil Arya;David M. Mount;Nathan S. Netanyahu;Ruth Silverman.
symposium on discrete algorithms (1994)

949 Citations

The discrete geodesic problem

Joseph S. B. Mitchell;David M. Mount;Christos H. Papadimitriou.
SIAM Journal on Computing (1987)

743 Citations

A local search approximation algorithm for k-means clustering

Tapas Kanungo;David M. Mount;Nathan S. Netanyahu;Christine D. Piatko.
symposium on computational geometry (2002)

694 Citations

Approximate nearest neighbor queries in fixed dimensions

Sunil Arya;David M. Mount.
symposium on discrete algorithms (1993)

565 Citations

ANN: library for approximate nearest neighbor searching

Sunil Arya;DM Mount.
Proceedings of IEEE CGC Workshop on Computational Geometry, Providence, RI (1998)

478 Citations

Algorithms for facility location problems with outliers

Moses Charikar;Samir Khuller;David M. Mount;Giri Narasimhan.
symposium on discrete algorithms (2001)

412 Citations

An output-sensitive algorithm for computing visibility

Subir Kumar Ghosh;David M. Mount.
SIAM Journal on Computing (1991)

333 Citations

Isomorphism of graphs with bounded eigenvalue multiplicity

László Babai;D. Yu. Grigoryev;David M. Mount.
symposium on the theory of computing (1982)

251 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing David M. Mount

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 59

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 48

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 40

Joachim Gudmundsson

Joachim Gudmundsson

University of Sydney

Publications: 39

Ying He

Ying He

Nanyang Technological University

Publications: 38

David Eppstein

David Eppstein

University of California, Irvine

Publications: 35

Danny Z. Chen

Danny Z. Chen

University of Notre Dame

Publications: 33

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 33

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 32

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 30

Piotr Indyk

Piotr Indyk

MIT

Publications: 29

Boris Aronov

Boris Aronov

New York University

Publications: 28

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 27

Marc van Kreveld

Marc van Kreveld

Utrecht University

Publications: 25

Michael D. Abràmoff

Michael D. Abràmoff

University of Iowa

Publications: 23

Subhash Suri

Subhash Suri

University of California, Santa Barbara

Publications: 21

Something went wrong. Please try again later.