TY - GEN
T1 - Frequent Temporal Social Behavior Search in information networks
AU - Hsieh, Hsun Ping
AU - Li, Cheng Te
AU - Lin, Shou De
PY - 2012
Y1 - 2012
N2 - In current social networking service (SNS) such as Facebook, there are diverse kinds of interactions between entity types. One commonly-used activity of SNS users is to track and observe the representative social and temporal behaviors of other individuals. This inspires us to propose a new problem of Temporal Social Behavior Search (TSBS) from social interactions in an information network: given a structural query with associated temporal labels, how to find the subgraph instances satisfying the query structure and temporal requirements? In TSBS, a query can be (a) a topological structure, (b) the partially-assigned individuals on nodes, and/or (c) the temporal sequential labels on edges. The TSBS method consists of two parts: offline miningand online matching. to the former mines the temporal subgraph patterns for retrieving representative structures that match the query. Then based on the given query, we perform the online structural matching on the mined patterns and return the top-k resulting subgraphs. Experiments on academic datasets demonstrate the effectiveness of TSBS. Copyright is held by the author/owner(s).
AB - In current social networking service (SNS) such as Facebook, there are diverse kinds of interactions between entity types. One commonly-used activity of SNS users is to track and observe the representative social and temporal behaviors of other individuals. This inspires us to propose a new problem of Temporal Social Behavior Search (TSBS) from social interactions in an information network: given a structural query with associated temporal labels, how to find the subgraph instances satisfying the query structure and temporal requirements? In TSBS, a query can be (a) a topological structure, (b) the partially-assigned individuals on nodes, and/or (c) the temporal sequential labels on edges. The TSBS method consists of two parts: offline miningand online matching. to the former mines the temporal subgraph patterns for retrieving representative structures that match the query. Then based on the given query, we perform the online structural matching on the mined patterns and return the top-k resulting subgraphs. Experiments on academic datasets demonstrate the effectiveness of TSBS. Copyright is held by the author/owner(s).
UR - http://www.scopus.com/inward/record.url?scp=84861042210&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861042210&partnerID=8YFLogxK
U2 - 10.1145/2187980.2188110
DO - 10.1145/2187980.2188110
M3 - Conference contribution
AN - SCOPUS:84861042210
SN - 9781450312301
T3 - WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion
SP - 527
EP - 528
BT - WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion
T2 - 21st Annual Conference on World Wide Web, WWW'12
Y2 - 16 April 2012 through 20 April 2012
ER -