• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Liao Guoqiong, Wang Tingli, Deng Kun, Wan Changxuan. Multi-User Location Proximity Prediction in Offline Ephemeral Social Networks[J]. Journal of Computer Research and Development, 2016, 53(11): 2645-2653. DOI: 10.7544/issn1000-1239.2016.20150388
Citation: Liao Guoqiong, Wang Tingli, Deng Kun, Wan Changxuan. Multi-User Location Proximity Prediction in Offline Ephemeral Social Networks[J]. Journal of Computer Research and Development, 2016, 53(11): 2645-2653. DOI: 10.7544/issn1000-1239.2016.20150388

Multi-User Location Proximity Prediction in Offline Ephemeral Social Networks

More Information
  • Published Date: October 31, 2016
  • Offline ephemeral social network (OffESN) is defined as a new kind of offline social networks created at a specific location for a specific purpose temporally, and lasting for a short period of time. With the popularity of mobile intelligent terminals and the development of short distance communication technologies such as Bluetooth and RFID, the OffESN is receiving more and more attentions from industry and academic communities. Location proximity relations are encounter relations of the users in the OffESN. Aiming to the characteristics such as dynamic change and short duration time, this paper intends to study the problem of multi-user location proximity in the OffESN. First of all, the paper puts forward relevant concepts in the OffESN and defines the problem to be solved. Then, it designs the overall framework of multi-user location proximity prediction, including network segments collection, overlay networks construction, network filter and maximal close subgraphs discovery. Based on the framework and the splitting idea, the paper suggests a maximal close subgraph discovery algorithm for predicting multi-user location proximity. The algorithm uses weighted edge betweenness (WEB) as the basis of splitting, and uses the aggregate density as the termination condition of spitting, which can effectively solve the problem that both numbers of location proximity relations and the users in each location proximity are uncertain. Finally, the experiments on two real datasets verify the feasibility and efficiency of the suggested prediction strategy.
  • Related Articles

    [1]Zhang Chunyun, Zhao Hongyan, Deng Jiqin, Cui Chaoran, Dong Xiaolin, Chen Zhumin. Category Adversarial Joint Learning Method for Cross-Prompt Automated Essay Scoring[J]. Journal of Computer Research and Development, 2025, 62(5): 1190-1204. DOI: 10.7544/issn1000-1239.202440266
    [2]Lu Feng, Li Wei, Gu Lin, Liu Shuai, Wang Runheng, Ren Yufei, Dai Xiaohai, Liao Xiaofei, Jin Hai. Selection of Reputable Medical Participants Based on an Iterative Collaborative Learning Framework[J]. Journal of Computer Research and Development, 2024, 61(9): 2347-2363. DOI: 10.7544/issn1000-1239.202330270
    [3]Lu Yuxuan, Kong Lanju, Zhang Baochen, Min Xinping. MC-RHotStuff: Multi-Chain Oriented HotStuff Consensus Mechanism Based on Reputation[J]. Journal of Computer Research and Development, 2024, 61(6): 1559-1572. DOI: 10.7544/issn1000-1239.202330195
    [4]Zheng Susu, Fu Xiaodong, Yue Kun, Liu Li, Liu Lijun, Feng Yong. Online Service Reputation Measurement Method Based on Kendall tau Distance[J]. Journal of Computer Research and Development, 2019, 56(4): 884-894. DOI: 10.7544/issn1000-1239.2019.20180034
    [5]Ma Haiyan, Liang Yongquan, Ji Shujuan, Li Da. A Trust-Distrust Based Reputation Attacks Defending Strategy and Its Stability Analysis[J]. Journal of Computer Research and Development, 2018, 55(12): 2685-2702. DOI: 10.7544/issn1000-1239.2018.20170587
    [6]Zhang Yuanpeng, Deng Zhaohong, Chung Fu-lai, Hang Wenlong, Wang Shitong. Fast Self-Adaptive Clustering Algorithm Based on Exemplar Score Strategy[J]. Journal of Computer Research and Development, 2018, 55(1): 163-178. DOI: 10.7544/issn1000-1239.2018.20160937
    [7]Lin Hui, Ma Jianfeng, Xu Li. A Secure Routing Protocol for MWNs Based on Cross-Layer Dynamic Reputation Mechanism[J]. Journal of Computer Research and Development, 2014, 51(7): 1486-1496.
    [8]Ma Shouming, Wang Ruchuan, Ye Ning. Secure Data Aggregation Algorithm Based on Reputations Set Pair Analysis in Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2011, 48(9): 1652-1658.
    [9]Zhao Xiang, Huang Houkuan, Dong Xingye, and He Lijian. A Trust and Reputation System Model for Open Multi-Agent System[J]. Journal of Computer Research and Development, 2009, 46(9): 1480-1487.
    [10]He Lijian, Huang Houkuan, Zhang Wei. A Survey of Trust and Reputation Systems in Multi Agent Systems[J]. Journal of Computer Research and Development, 2008, 45(7).

Catalog

    Article views (1134) PDF downloads (523) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return