| dc.contributor | 資科系 | - |
| dc.creator (作者) | Li, C.-T.;Shan, Man-Kwan.;Lin, S.-D. | - |
| dc.creator (作者) | 沈錳坤 | - |
| dc.date (日期) | 2011 | - |
| dc.date.accessioned | 8-Apr-2015 17:33:34 (UTC+8) | - |
| dc.date.available | 8-Apr-2015 17:33:34 (UTC+8) | - |
| dc.date.issued (上傳時間) | 8-Apr-2015 17:33:34 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/74403 | - |
| dc.description.abstract (摘要) | In online social networking services, there are a range of scenarios in which users want to search a particular person given the targeted person one`s name. The challenge of such people search is namesake, which means that there are many people possess the same names in the social network. In this paper, we propose to leverage the query contexts to tackle such problems. For example, given the information of one`s graduation year and city, the last names of some individuals, one may wish to find classmates from his/her high school. We formulate such problem as the context-based people search. Given a social network in which each node is associated with a set of labels and given a query set of labels consisting of a targeted name label and other context labels, our goal is to return a ranking list of persons who possess the targeted name label and connects to other context labels with minimum communication costs through an effective subgraph in the social network. We consider the interactions among query labels to propose a grouping-based method to solve the context-based people search. Our method consists of three major parts. First, we model those nodes with query labels into a group graph which is able to reduce the search space to enhance the time efficiency. Second, we identify three different kinds of connectors which connecting different groups, and exploit connectors to find the corresponding detailed graph topology from the group graph. Third, we propose a Connector-Steiner Tree algorithm to retrieve a resulting ranked list of individuals who possess the targeted label. Experimental results on the DBLP bibliography data show that our grouping-based method can reach the good quality of returned persons as a greedy search algorithm at a considerable outperformance on the time efficiency. © 2011 ACM. | - |
| dc.format.extent | 735818 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Proceedings of the 20th ACM international conference on Information and knowledge management,1607-1612 | - |
| dc.subject (關鍵詞) | Communication cost; Context-based; Context-based search; Graph topology; Greedy search algorithms; High school; people search; Query context; Search spaces; Social Networks; Subgraphs; Time efficiencies; Tree algorithms; Algorithms; Knowledge management; Social networking (online); Topology; Trees (mathematics) | - |
| dc.title (題名) | Context-based people search in labeled social networks | - |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1145/2063576.2063809 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1145/2063576.2063809 | - |
