Login / Signup

Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs.

Yanping WuRenjie SunXiaoyang WangDong WenYing ZhangLu QinXuemin Lin
Published in: CoRR (2024)
Keyphrases
  • bipartite graph
  • maximal frequent
  • maximum matching
  • frequent item sets
  • data sets
  • learning algorithm
  • knowledge discovery