{"title":"利用基于位置的社交网络数据发现最具影响力的地理社会对象","authors":"Pengfei Jin, Zhanyu Liu, Yao Xiao","doi":"10.1109/ICBK50248.2020.00091","DOIUrl":null,"url":null,"abstract":"In the scope of knowledge engineering, discovering the most influential geo-social object is one of the most extensively studied problems, where the reverse top-k queries can be used as a key technique to detect the influence set, also refereed as potential customers in this paper. By issuing reverse top-k queries, merchants can get the knowledge of the potential influence of their products and then make effective decisions in business promotion applications. In this paper, we study the problem of discovering most influential geo-social object using LBSN data. More specifically, given a set $\\mathcal{U}$ of LBSN users, a set $\\mathcal{O}$ of geo-social objects, and a set $\\mathcal{O}$ of candidate objects extracted from $\\mathcal{O}_{c}$, we attempt to find the optimal one in $\\mathcal{C}$ that has the largest potential influence, where the potential influence of an object is defined by the size of users in its reverse top-k query results. Such problem is practical for merchants to monitor which product among all the products is the most popular with the potential customers. A baseline approach based on a batch processing framework is proposed to facilitate answering this problem. On the top of this solution, a series of optimizations are integrated to further improve its performance and make it more efficient in practise. Experiments on two datasets are conducted to verify the effectiveness and efficiency of the proposed methods.","PeriodicalId":432857,"journal":{"name":"2020 IEEE International Conference on Knowledge Graph (ICKG)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Discovering the Most Influential Geo-Social Object Using Location Based Social Network Data\",\"authors\":\"Pengfei Jin, Zhanyu Liu, Yao Xiao\",\"doi\":\"10.1109/ICBK50248.2020.00091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the scope of knowledge engineering, discovering the most influential geo-social object is one of the most extensively studied problems, where the reverse top-k queries can be used as a key technique to detect the influence set, also refereed as potential customers in this paper. By issuing reverse top-k queries, merchants can get the knowledge of the potential influence of their products and then make effective decisions in business promotion applications. In this paper, we study the problem of discovering most influential geo-social object using LBSN data. More specifically, given a set $\\\\mathcal{U}$ of LBSN users, a set $\\\\mathcal{O}$ of geo-social objects, and a set $\\\\mathcal{O}$ of candidate objects extracted from $\\\\mathcal{O}_{c}$, we attempt to find the optimal one in $\\\\mathcal{C}$ that has the largest potential influence, where the potential influence of an object is defined by the size of users in its reverse top-k query results. Such problem is practical for merchants to monitor which product among all the products is the most popular with the potential customers. A baseline approach based on a batch processing framework is proposed to facilitate answering this problem. On the top of this solution, a series of optimizations are integrated to further improve its performance and make it more efficient in practise. Experiments on two datasets are conducted to verify the effectiveness and efficiency of the proposed methods.\",\"PeriodicalId\":432857,\"journal\":{\"name\":\"2020 IEEE International Conference on Knowledge Graph (ICKG)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Conference on Knowledge Graph (ICKG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICBK50248.2020.00091\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Knowledge Graph (ICKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBK50248.2020.00091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Discovering the Most Influential Geo-Social Object Using Location Based Social Network Data
In the scope of knowledge engineering, discovering the most influential geo-social object is one of the most extensively studied problems, where the reverse top-k queries can be used as a key technique to detect the influence set, also refereed as potential customers in this paper. By issuing reverse top-k queries, merchants can get the knowledge of the potential influence of their products and then make effective decisions in business promotion applications. In this paper, we study the problem of discovering most influential geo-social object using LBSN data. More specifically, given a set $\mathcal{U}$ of LBSN users, a set $\mathcal{O}$ of geo-social objects, and a set $\mathcal{O}$ of candidate objects extracted from $\mathcal{O}_{c}$, we attempt to find the optimal one in $\mathcal{C}$ that has the largest potential influence, where the potential influence of an object is defined by the size of users in its reverse top-k query results. Such problem is practical for merchants to monitor which product among all the products is the most popular with the potential customers. A baseline approach based on a batch processing framework is proposed to facilitate answering this problem. On the top of this solution, a series of optimizations are integrated to further improve its performance and make it more efficient in practise. Experiments on two datasets are conducted to verify the effectiveness and efficiency of the proposed methods.