Home › Entities › academia › Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation

Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation

Research article (Proceedings of the ACM on Management of Data, 2023) · cited 19× · AI/ML
academia openalex:W4381329639
Press Enter · cited answer in seconds

Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation

Summary

Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation is a scholarly article[1].

Key Facts

  • Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation. Retrieved May 24, 2026, from https://4ort.xyz/entity/efficient-and-effective-attributed-hypergraph-clustering-via-k-nearest-neighbor-augmentation
MLA “Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/efficient-and-effective-attributed-hypergraph-clustering-via-k-nearest-neighbor-augmentation.
BibTeX @misc{4ortxyz_efficient-and-effective-attributed-hypergraph-clustering-via-k-nearest-neighbor-augmentation_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation}}, year = {2026}, url = {https://4ort.xyz/entity/efficient-and-effective-attributed-hypergraph-clustering-via-k-nearest-neighbor-augmentation}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation — https://4ort.xyz/entity/efficient-and-effective-attributed-hypergraph-clustering-via-k-nearest-neighbor-augmentation (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/efficient-and-effective-attributed-hypergraph-clustering-via-k-nearest-neighbor-augmentation · Last refreshed: