DOI: 10.1145/1081870.1081948. A fast kernel-based multilevel algorithm for graph clustering

A fast kernel-based multilevel algorithm for graph clustering

10.1145/1081870.1081948

Crossref proceedings-article

ACM

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining (320)

Bibliography

Dhillon, I., Guan, Y., & Kulis, B. (2005). A fast kernel-based multilevel algorithm for graph clustering. Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, 629â634.

Authors 3

Inderjit Dhillon (first)
Yuqiang Guan (additional)
Brian Kulis (additional)

References 8 Referenced 66

T. Bui and C. Jones . A heuristic for reducing fill-in in sparse matrix factorization . In 6th SIAM Conference on Parallel Processing for Scientific Computing , pages 445 -- 452 , 1993 . T. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In 6th SIAM Conference on Parallel Processing for Scientific Computing, pages 445--452, 1993. / 6th SIAM Conference on Parallel Processing for Scientific Computing by Bui T. (1993)
10.1109/43.310898
10.1145/1014052.1014118
10.5555/844380.844769
10.1147/rd.175.0420
10.1137/S1064827595287997
10.1109/34.868688
10.5555/946247.946658

Dates

Type	When
Created	19 years, 9 months ago (Nov. 7, 2005, 12:34 p.m.)
Deposited	2 months, 2 weeks ago (June 18, 2025, 12:18 p.m.)
Indexed	2 months, 2 weeks ago (June 19, 2025, 12:42 a.m.)
Issued	20 years ago (Aug. 21, 2005)
Published	20 years ago (Aug. 21, 2005)
Published Online	20 years ago (Aug. 21, 2005)
Published Print	20 years ago (Aug. 21, 2005)

Funders 0

None

BibTeX

@inproceedings{Dhillon_2005, series={KDD05}, title={A fast kernel-based multilevel algorithm for graph clustering}, url={http://dx.doi.org/10.1145/1081870.1081948}, DOI={10.1145/1081870.1081948}, booktitle={Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining}, publisher={ACM}, author={Dhillon, Inderjit and Guan, Yuqiang and Kulis, Brian}, year={2005}, month=aug, pages={629–634}, collection={KDD05} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        6,
        19
      ]
    ],
    "date-time": "2025-06-19T04:42:26Z",
    "timestamp": 1750308146857,
    "version": "3.41.0"
  },
  "publisher-location": "New York, NY, USA",
  "reference-count": 8,
  "publisher": "ACM",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            2005,
            8,
            21
          ]
        ],
        "date-time": "2005-08-21T00:00:00Z",
        "timestamp": 1124582400000
      },
      "content-version": "vor",
      "delay-in-days": 0,
      "URL": "https://www.acm.org/publications/policies/copyright_policy#Background"
    }
  ],
  "content-domain": {
    "domain": [
      "dl.acm.org"
    ],
    "crossmark-restriction": true
  },
  "published-print": {
    "date-parts": [
      [
        2005,
        8,
        21
      ]
    ]
  },
  "DOI": "10.1145/1081870.1081948",
  "type": "proceedings-article",
  "created": {
    "date-parts": [
      [
        2005,
        11,
        7
      ]
    ],
    "date-time": "2005-11-07T17:34:39Z",
    "timestamp": 1131384879000
  },
  "page": "629-634",
  "update-policy": "https://doi.org/10.1145/crossmark-policy",
  "source": "Crossref",
  "is-referenced-by-count": 66,
  "title": "A fast kernel-based multilevel algorithm for graph clustering",
  "prefix": "10.1145",
  "author": [
    {
      "given": "Inderjit",
      "family": "Dhillon",
      "sequence": "first",
      "affiliation": [
        {
          "name": "University of Texas at Austin, Austin, TX"
        }
      ]
    },
    {
      "given": "Yuqiang",
      "family": "Guan",
      "sequence": "additional",
      "affiliation": [
        {
          "name": "University of Texas at Austin, Austin, TX"
        }
      ]
    },
    {
      "given": "Brian",
      "family": "Kulis",
      "sequence": "additional",
      "affiliation": [
        {
          "name": "University of Texas at Austin, Austin, TX"
        }
      ]
    }
  ],
  "member": "320",
  "published-online": {
    "date-parts": [
      [
        2005,
        8,
        21
      ]
    ]
  },
  "reference": [
    {
      "key": "e_1_3_2_1_1_1",
      "first-page": "445",
      "volume-title": "6th SIAM Conference on Parallel Processing for Scientific Computing",
      "author": "Bui T.",
      "year": "1993",
      "unstructured": "T. Bui and C. Jones . A heuristic for reducing fill-in in sparse matrix factorization . In 6th SIAM Conference on Parallel Processing for Scientific Computing , pages 445 -- 452 , 1993 . T. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In 6th SIAM Conference on Parallel Processing for Scientific Computing, pages 445--452, 1993."
    },
    {
      "key": "e_1_3_2_1_2_1",
      "doi-asserted-by": "publisher",
      "DOI": "10.1109/43.310898"
    },
    {
      "key": "e_1_3_2_1_3_1",
      "doi-asserted-by": "publisher",
      "DOI": "10.1145/1014052.1014118"
    },
    {
      "key": "e_1_3_2_1_5_1",
      "doi-asserted-by": "publisher",
      "DOI": "10.5555/844380.844769"
    },
    {
      "key": "e_1_3_2_1_6_1",
      "doi-asserted-by": "publisher",
      "DOI": "10.1147/rd.175.0420"
    },
    {
      "key": "e_1_3_2_1_8_1",
      "doi-asserted-by": "publisher",
      "DOI": "10.1137/S1064827595287997"
    },
    {
      "key": "e_1_3_2_1_9_1",
      "doi-asserted-by": "publisher",
      "DOI": "10.1109/34.868688"
    },
    {
      "key": "e_1_3_2_1_10_1",
      "doi-asserted-by": "publisher",
      "DOI": "10.5555/946247.946658"
    }
  ],
  "event": "KDD05: The Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining",
  "container-title": "Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining",
  "original-title": [],
  "link": [
    {
      "URL": "https://dl.acm.org/doi/10.1145/1081870.1081948",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "https://dl.acm.org/doi/pdf/10.1145/1081870.1081948",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2025,
        6,
        18
      ]
    ],
    "date-time": "2025-06-18T16:18:38Z",
    "timestamp": 1750263518000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://dl.acm.org/doi/10.1145/1081870.1081948"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        2005,
        8,
        21
      ]
    ]
  },
  "references-count": 8,
  "alternative-id": [
    "10.1145/1081870.1081948",
    "10.1145/1081870"
  ],
  "URL": "http://dx.doi.org/10.1145/1081870.1081948",
  "relation": {},
  "subject": [],
  "published": {
    "date-parts": [
      [
        2005,
        8,
        21
      ]
    ]
  },
  "assertion": [
    {
      "value": "2005-08-21",
      "order": 2,
      "name": "published",
      "label": "Published",
      "group": {
        "name": "publication_history",
        "label": "Publication History"
      }
    }
  ]
}