( en | de | ru )

 

Disambiguation of "Louis, Anand"

Author of the publication

copydeleteadd this publication to your clipboard
Socially Fair Center-Based and Linear Subspace Clustering.

, , , and . ECML/PKDD (1), volume 14169 of Lecture Notes in Computer Science, page 727-742. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Davinder Kumar Anand

Amar Frank Anand

Madhankumar Anandhakrishnan

Anand Raghavachar

Anand Roy

 

Other publications of authors with the same name

NHP: Neural Hypergraph Link Prediction., , , , , and . CIKM, page 1705-1714. ACM, (2020)HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs., , , , , and . NeurIPS, page 1509-1520. (2019)Group Fairness for Knapsack Problems., , and . AAMAS, page 1001-1009. ACM, (2021)Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery., and . ICALP, volume 107 of LIPIcs, page 101:1-101:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Euclidean k-Means Clustering with alpha-Center Proximity., , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 2087-2095. PMLR, (2019)Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes., , and . SWAT, volume 294 of LIPIcs, page 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Socially Fair Center-based and Linear Subspace Clustering., , , and . CoRR, (2022)New Approximation Bounds for Small-Set Vertex Expansion., and . CoRR, (2023)Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion., and . Theory of Computing, 12 (1): 1-25 (2016)Bipartite Matchings with Group Fairness and Individual Fairness Constraints., , and . CoRR, (2022)