Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search

Benjamin Moseley, Joshua Wang

Oct-4-2024, 07:17:53 GMT–Neural Information Processing Systems

Neural Information Processing Systems http://nips.cc/

algorithm, objective, similarity, (14 more...)

Neural Information Processing Systems

Oct-4-2024, 07:17:53 GMT

Conferences PDF

Country:
- Asia > Afghanistan
  - Parwan Province > Charikar (0.04)
- Europe
  - Germany > North Rhine-Westphalia
    - Cologne Region > Bonn (0.04)
  - Spain > Catalonia
    - Barcelona Province > Barcelona (0.04)
  - United Kingdom > Scotland
    - City of Edinburgh > Edinburgh (0.04)
- North America
  - Canada
    - British Columbia > Metro Vancouver Regional District
      - Vancouver (0.04)
    - Ontario > Toronto (0.04)
    - Quebec > Montreal (0.04)
  - United States
    - California
      - Los Angeles County > Long Beach (0.04)
      - Santa Clara County
        Palo Alto (0.04)
        Stanford (0.04)
    - Massachusetts > Middlesex County
      - Cambridge (0.04)
    - New York > New York County
      - New York City (0.14)
    - Pennsylvania > Allegheny County
      - Pittsburgh (0.14)

Technology:
- Information Technology > Artificial Intelligence
  - Machine Learning > Statistical Learning
    - Clustering (1.00)
  - Representation & Reasoning (1.00)

Duplicate Docs Excel Report

Title
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search

Similar Docs Excel Report more

Title	Similarity	Source
None found