大数据时代的简约计算

张家琳; 孙晓明

doi:10.11959/j.issn.2096-0271.2016037

您当前的位置：

首页 >

文章列表页 >

大数据时代的简约计算

研究 | 更新时间：2024-06-03

- 大数据时代的简约计算
- On the measurements of algorithms in big data era
- 大数据 2016年2卷第4期页码：2016037
- 作者机构：
- 作者简介：
  
  [ "张家琳（1983-），中国科学院计算技术研究所副研究员，主要研究方向为在线算法、近似算法、社交网络、算法博弈论等。" ]
  [ "孙晓明（1978-），中国科学院计算技术研究所研究员，主要研究方向为算法与计算复杂性、量子计算等。" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(61222202);国家自然科学基金资助项目;The National Natural Science Foundation of China(61502449);中组部万人计划青年拔尖人才项目;The China National Program for Support of Top-notch Young Professionals
- DOI：10.11959/j.issn.2096-0271.2016037
  中图分类号： TP3-0
- 网络首发：2016-07，
  
  纸质出版：2016-07-20
- 稿件说明：
移动端阅览
张家琳, 孙晓明. 大数据时代的简约计算[J]. 大数据, 2016,2(4):2016037.

Jialin ZHANG, Xiaoming SUN. On the measurements of algorithms in big data era[J]. Big Data Research2016, 2(4): 2016037.
张家琳, 孙晓明. 大数据时代的简约计算[J]. 大数据, 2016,2(4):2016037. DOI： 10.11959/j.issn.2096-0271.2016037.

Jialin ZHANG, Xiaoming SUN. On the measurements of algorithms in big data era[J]. Big Data Research2016, 2(4): 2016037. DOI： 10.11959/j.issn.2096-0271.2016037.

摘要

大数据存储和分析的能力是未来创新型国家的核心战略能力。当前关于大数据的理论研究在共性问题提炼、方法论框架和实时数据算法理论上仍存在一些不足，从大数据“海量、实时、多样”三大特征出发，聚焦网络大数据这一对象，以数据复杂性的度量和约简作为主线，具体从网络链路预测及推荐、动态演化网络上的算法研究、网络小世界模型与信息传播3个问题出发，研究大数据在时间、空间和关联关系上的简约计算。

Abstract

The ability to store and analyze big data is a crucial capability of a powerful country in the new century.The current research of big data contains weakness on common scientific questions

general methodology

and theoretical analysis of real-time algorithm.It started from three key features about big data:volume

variety

and velocity

and the measurement and simplification of time complexity

space complexity

and relationship complexity for big data were focused.

关键词

Keywords

references

DEAN J , GHEMAWAT S . MapReduce:simplified data processing on large clusters [J ] . Communications of the ACM , 2008 , 51 ( 1 ): 107 - 113 .

SUOMELA J . Survey of local algorithms [J ] . ACM Computing Surveys (CSUR) , 2013 , 45 ( 2 ): 94 - 111 .

DESIKAN P , PATHAK N , SRIVASTAVA J , et al . Incremental page rank computation on evolving graphs [C ] // The 14th International Conference on World Wide Web,May 10-14,2005 , Chiba,Japan . New York ： ACM Press , 2005 : 1094 - 1095 .

BAHMANI B , CHOWDHURY A , GOEL A . Fast incremental and personalized PageRank [J ] . Proceedings of the VLDB Endowment , 2010 , 4 ( 3 ): 173 - 184 .

WATTS D J , STROGATZ S H . Collective dynamics of “small-world” networks [J ] . Nature , 1998 , 393 ( 6684 ): 440 - 442 .

HOLME P , SARAMÄKI J . Temporal networks [J ] . Physics Reports , 2011 , 519 ( 3 ): 97 - 125 .

PAN R K,SARAMÄKI J . Path lengths,correlations,and centrality in temporal networks [J ] . Physical Review E Statistical Nonlinear ＆ Soft Matter Physics , 2011 , 84 ( 1 Pt 2 ): 1577 - 1589 .

NEWMAN M E J . Modularity and community structure in networks [J ] . Proceedings of the National Academy of Sciences , 2006 , 103 ( 1 ): 8577 - 8582 .

FORTUNATO S . Community detection in graphs [J ] . Physics Reports , 2010 , 486 ( 3-5 ): 75 - 174 .

NEWMAN M E J . Fast algorithm for detecting community structure in networks [J ] . Physics Review , 2004 ,E69,066133.

SCHAFER L , GRAHAM J W . Missing data:our view of the state of the art [J ] . Psychological Methods , 2002 , 7 ( 2 ): 147 - 177 .

ZHANG Q M,LÜ L , WANG W Q , et al . Potential theory for directed networks [J ] . Plos One , 2013 , 8 ( 2 ):e55437.

AGGARWAL C C , WOLF J L , WU K L , et al . Horting hatches an egg:a new graph-theoretic approach to collaborative filtering [C ] // The Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 15-18,1999,San Diego,CA,USA . New York:ACM Press , 1999 : 201 - 212 .

HUANG Z , ZENG D , CHEN H . Analyzing consumer-product graphs:empirical findings and applications inrecommender systems [J ] . Management science , 2007 , 53 ( 7 ): 1146 - 1164 .

LÜ L , ZHOU T . Link prediction in complex networks:a survey [J ] . Physica A Statistical Mechanics ＆ Its Applications , 2011 , 390 ( 6 ): 1150 - 1170 .

LÜ L , PAN L , ZHOU T , et al . Toward link predictability of complex networks [J ] . Proceedings of the National Academy of Sciences of the United States of America , 2015 , 112 ( 8 ): 2325 - 2330 .

MAN T , SHEN H W , HUANG J M , et al . Context-adaptive matrix factorization for multi-context recommendation [C ] // The 24th ACM International Conference on Information and Knowledge Management(CIKM),October 19-23,2015 , Melbourne,Australia . New York ： ACM Press , 2015 : 901 - 910 .

WANG P F , GUO J F , LAN Y Y , et al . Learning hierarchical representation model for next basket recommendation [C ] // The 38th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2015),August 9-13,2015 , Santiago,Chile . New York ： ACM Press , 2015 : 403 - 412 .

SUN X M , ZHANG J , ZHANG J L . Solving multi-choice secretary problem in parallel:an optimal observation-selection protocol [C ] // The 25th International Symposium on Algorithms and Computation (ISAAC 2014),December 1517,2014 , Jeonju,Korea .[S.l. ] : Springer International Publishing , 2014 : 661 - 673 .

SHAO J , HAN Z , YANG Q , et al . Community detection based on distance dynamics [C ] // The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 10-13,2015 , Sydney,Australia . New York ： ACM Press , 2015 : 1075 - 1084 .

HUANG Q , LIU X W , SUN X M , et al . How to select the top-k elements from evolving data? [C ] // The 26th International Symposium on Algorithms and Computation (ISAAC 2015),August 3-8,2015 , Macao,China . New York ： ACM Press , 2015 : 60 - 70 .

YANG Z , CHEN W . A game theoretic model for the formation of navigable small-world networks [C ] // The 4th International World Wide Web Conference (WWW’2015),May 18-22,2015 , Florence,Italy . 2015 .

ZHANG P , CHEN W , SUN X M , et al . Minimizing seed set selection with probabilistic coverage guarantee in a social network [C ] // The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 24-27,2014,New York,USA . New York:ACM Press , 2014 : 1306 - 1315 .

SHAN X H , CHEN W , LI Q , et al . Cumulative activation in social networks [J ] . 2016 ,arXiv:1605.04635.

LU W , CHEN W , LAKSHMANAN L V S . From competition to complementarity:comparative influence diffusion and maximization [C ] // The 42nd International Conference on Very Large Data Bases (VLDB’2016),September 5-9,2016,New Delhi,India . New York:ACM Press , 2015 : 60 - 71 .

ZHONG L F , LIU J G , SHANG M S . Iterative resource allocation based on propagation feature of node for identifying the influential nodes [J ] . Physics Letters A , 2015 , 379 ( 38 ): 2272 - 2276 .

浏览量

818

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据