Identifying cohesive subgraphs in hypergraphs is a fundamental problem that has received recent attention in data mining and engineering fields. Existing approaches mainly focus on a strongly induced subhypergraph or edge cardinality, overlooking the importance of the frequency of co-occurrence. In this paper, we propose a new cohesive subgraph named (k,g)-core, which considers both neighbour and co-occurrence simultaneously. The (k,g)-core has various applications including recommendation system, network analysis, and fraud detection. To the best of our knowledge, this is the first work to combine these factors. We extend an existing efficient algorithm to find solutions for (k,g)-core. Finally, we conduct extensive experimental studies that demonstrate the efficiency and effectiveness of our proposed algorithm.

Much research has been done in the past for segmenting lecture videos by detecting slide transitions. However, they do not perform well on certain kinds of videos recorded under non-stationary settings: the changes of a camera position or focus during a lecture. Since such non-stationary settings greatly affect visual properties of slides, the existing approaches utilizing global features and a global threshold, often have trouble in computing similarities between slides. In this paper, we propose a highly accurate method for lecture video segmentation by using SIFT and an adaptive threshold. By using SIFT, we can reliably match two slides whose contents are the same but are visually different. We also propose an adaptive threshold selection algorithm that detects slide transitions accurately by considering characteristics of features. Through various experiments that use real lecture videos, we show that our method provides 30% improvement in the average F1-score over other existing methods.