Closed BradReesWork closed 3 years ago
This issue has been labeled inactive-30d
due to no recent activity in the past 30 days. Please close this issue if no further response or action is needed. Otherwise, please respond with a comment indicating any updates or changes to the original issue and/or confirm this issue still needs to be addressed. This issue will be labeled inactive-90d
if there is no activity in the next 60 days.
closing - we are planning on redoing K-Truss using graph primitives and will address issue then
K-Truss is a popular community detection alternative to Louvain. The algorithm should find all Trusses of a given K and return information similar to Louvain and other clustering analytics, namely a dataframe with:
df[‘vertex’] cudf.Series df[‘partition’] cudf.Series