期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2015
卷号：8
期号：3
页码：351-358
DOI：10.14257/ijgdc.2015.8.3.32
出版社：SERSC
摘要：The sign-in service of Mobile Social Networking Services (MSNS) has a serious issue of privacy disclosure. As to solving this issue, there is a method proposed to protect privacy. This method is to conduct binary coding for sign-in sequence and then construct ant path diagram. The random search, the positive and negative feedback principle of ant path graph are applied to mine frequent item sets. The longest common subsequence is achieved from sign-in sequence and corresponding frequent item sets. Finally, k- anonymous sign-in sequence will be obtained. Based on real data, this method is compared with anonymity - ) , ( . k which proves the accuracy and efficiency of this method through various aspects.
关键词：privacy preservation; mobile social networks; ant colony algorithm; k- ; anonymous
