期刊文献+

一种隐私保护的序列数据马尔可夫分类方案 被引量:3

Privacy Preserving Scheme for Sequence Classification Based on Markov Model
下载PDF
导出
摘要 数据挖掘是当前热门的研究方向,序列数据分类作为一种非典型的数据挖掘任务在很多领域有广泛的应用前景,例如金融、生物等领域.由于序列数据难以定义特征,其分类问题,传统的基于特征的分类方法难以适用.一种常见的解决方案是使用概率模型进行序列分类,例如马尔可夫模型.在大数据时代,经常需要多个独立的机构或个人共享数据进行数据挖掘任务,很多数据由于伦理、法律等方面的问题,不适合直接共享.本文在保证每个参与方数据隐私(包括数据本身以及数据的统计特征)的前提下针对如何训练马尔可夫模型,借助密码学技术提出了一个解决方案.方案针对1阶和2阶马尔可夫模型没有误差并且有较小的时间开销,尤其是训练轮数增加时性能较高. Nowadays data mining is a popular research area,as a special classification task,sequence classification has been extensively used in some area,such as finance,biology etc.It is hard to define the features for sequence data,traditional feature based classification algorithms are not good choices.A common way used on sequence classification are probability models,such as Markov model.In big data area,it is common for some individual institutions or people to undertake data mining tasks under collaboration.Faced with some problems such as ethic and law,it is not suitable to share data directly.In this paper,we use a cryptography scheme to solve the problem of how to train Markov model while preserving privacy(include data and statistical features of data).The results of firstorder and secondorder Markov model are very small in terms of time cost,especially with the increase of the train period.
出处 《小型微型计算机系统》 CSCD 北大核心 2018年第2期197-201,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61572456)资助 江苏省自然科学基金项目(BK20151241)资助
关键词 数据挖掘 隐私保护 序列分类 马尔可夫模型 data mining privacy preserving sequence classification Markov model
  • 相关文献

参考文献5

二级参考文献48

  • 1葛伟平,汪卫,周皓峰,施伯乐.基于隐私保护的分类挖掘[J].计算机研究与发展,2006,43(1):39-45. 被引量:20
  • 2宋世杰,胡华平,周嘉伟,金士尧.一种基于大项集重用的序列模式挖掘算法[J].计算机研究与发展,2006,43(1):68-74. 被引量:10
  • 3崔宾阁,刘大昕,王桐.支持快速查询的数据库加密方法研究[J].计算机科学,2006,33(6):115-118. 被引量:13
  • 4Yao A C. Protocols for secure computations [ C ]. In Proceedings of the 23^rd Annual IEEE Symposium on Foundations of Computer Science, 1982.
  • 5Yao A C. How to generate and exchange secrets[C]. In Proceedings of 27^th Symposium on Foundations of Computer Science ( FOCS), IEEE, 1986,162-167.
  • 6Goldreich O. Secure multi-party computation( working draft) [EB/ OL]. http://www, wisdom, weizmann, ac. il/-oded/PS/prot, ps 1998.
  • 7Du Wen-liang, Atallah J. Secure multi-party computation problems and their applications: a review and open problems[ C]. New Security Paradigms Workshop 2001, Cloudcroft, New Mexico, USA, 2001.
  • 8Mikhail J Atallah, Du Wen-hang. Secure multiparty computational geometry [ C] In lecture Notes in Computer Science, 2125, Springer Verlag. Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS 2001 ), August, 8-10, 2001, Providence, Rhode Island, USA, 165-179.
  • 9Shaft Goldwasser, Silvio Micali, Charles Rackoff. The knowledge complexity of interactive proof-systems[ C]. Proceedings of 17th Symposium on the Theory of Computation, Providence, Rhode Island, 1985.
  • 10Kilian J. Basing erpytography on oblivious transfer[ C]. In Proc. 20th Symposium on Theory of Computing ( STOC ' 88 ), New York, 1988. A. C. M. 20-31.

共引文献23

同被引文献19

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部