Method and system for detecting graph based event in social networks
AssigneeChungbuk National University Industry-Academic Cooperation Foundation
InventorsIna KIM, Jongtae Lim, Kyoungsoo Bok, Jaesoo Yoo
Life of this patent
Estimating the term…
Abstract
Provided is a method and system for detecting a graph-based event in a social network, the method including generating a keyword graph based on social data collected from a social network system; separating the keyword graph into a plurality of candidate graphs through clustering; calculating a user interest for each of the plurality of candidate graphs based on a per-time variation of a social action associated with the social data; and determining k candidate graphs from among the plurality of candidate graphs as an event graph based on the user interest. Here, k denotes a natural number.
Claims14
A method of detecting a graph-based event in a social network, the method comprising:
- generating a keyword graph based on social data collected from a social network system;
- separating the keyword graph into a plurality of candidate graphs through clustering;
- calculating a user interest for each of the plurality of candidate graphs based on a per-time variation of a social action associated with the social data;
- and
- determining k candidate graphs among the plurality of candidate graphs as an event graph based on the user interest, wherein k denotes a natural number.
A system for detecting a graph-based event in a social network, the system comprising:
- a generator configured to generate a keyword graph based on social data collected from a social network system;
- a clustering engine configured to separate the keyword graph into a plurality of candidate graphs through clustering;
- a calculator configured to calculate a user interest for each of the plurality of candidate graphs based on a per-time variation of a social action associated with the social data;
- and
- a determiner configured to determine k candidate graphs from among the plurality of candidate graphs as an event graph based on the user interest, wherein k denotes a natural number.
Dependencies are inferred from the claim text.