The Science of Attention

The X-ray of Homer Simpsons. Cited from Bones: The Dwarf in the Dirt (TV series )
The X-ray of Homer Simpsons. Cited from Bones: The Dwarf in the Dirt (TV series )

Research Questions

This page summarizes four projects lead by Lingfei Wu under the topic of "The Science of Attention" since summer 2015 (and we expect to have some primary results for publication at the end of 2015). The common goal of these studies is to understand the following questions:

What are the laws of attention dynamics ?

Can we exploit the power of human attention to develop "attention engine" and make machines as creative as human beings ?

What are the limitations of the intelligence of man-machine systems ?

These are big questions. We do not expect to address all of them in such a short period of time (half-year). But it is possible to find good angles to break these big questions into smaller ones that can be handled by research projects. These projects are designed to combine theoretical insights with practical consequences. Meanwhile, to demonstrate the interdisciplinary nature of attention science we select projects across different knowledge domains.

Previous Findings

My previous studies, including collaborations with Jiang Zhang, Rob Ackland, and Marco Janssen, uncovered the following dynamics of attention:

  1. The limitation of attention flow on the Web [1];
  2. The accelerating growth of attention as a power-law function of the number of active users in online communities [2][3][4][6];
  3. The fast decay of attention over time (stretched exponential function) [8];
  4. The re-production cycle of attention (attention loop and preferential return) [5][10];
  5. The decentralized tendency of attention allocation (reversed preferential attachment) [9].

Ongoing Projects

1. Location Based Advertising for Moving Citizens

Cheng-jun Wang and Lingfei Wu

The renormalization of user mobilization (network) in physical and cyber spaces.
The renormalization of user mobilization (network) in physical and cyber spaces.

The increasing power of search engines has made advertisement more and more precise - computational advertising systems like Google AdSense collect and filter the attention of the most relevant users and sale it to companies. However, how to reach target customers in the physical world precisely is still a question remained unsolved in the advertising industry. In the current study we analyze the anonymized smartphone data of 10^5 Beijing residents in 30 days and correlate their physical movement with flow of attention in cyberspace. In particular, we use network renormalization technique to divide the city into local areas and use information entropy based measurements to identify the most relevant website visited in these local areas. To demonstrate the applied value of our research we create an interactive map that takes the queries of website names as input and lights up the most relevant areas as output. This tool is particularly useful for dot-com companies who are interested in buying outdoor advertising space.

2. Quantifying the Attention Cost of Collaborative Knowledge Production

Lingfei Wu and Zi-gang Huang

The hierarchy in Collaborative Knowledge Production.
The hierarchy in Collaborative Knowledge Production.

Online communities are becoming increasingly important as platforms for knowledge production. In these communities users seek and share professional skills, spreading knowledge along the hierarchy of expertise levels. To investigate how users collaborate with each other in knowledge production, we analyze StackExchange, one of the largest question and answer systems in the world. Our dataset includes the asking and answering activities of 2.7 million users over 5 years across 110 communities. We construct expertise networks to include all pairs of help-seeking interactions and measure the expertise level Li of the ith user based on their positions in expertise networks. We calculate |Lj-Li| between all pairs of linked users i and j and suggest that, this variable characterizes the cost of attention users are willing to pay in helping others, because it is reasonable to assume that the communication between users across more expertise levels usually takes more efforts. We find that the distribution of |Lj-Li| is symmetrical and unimodal, with a small mean and a small standard deviation. This means that users at all expertise levels tend to help those whose levels are slightly below themselves. In other words, people do not go very far out of their "comfort zones" to help others. This observation explains the forming of hierarchy in large-scale knowledge production and provide an important guidance rule for building expert recommendation systems.

3. Predicting the Birth and Death of Sciences

Yanbo Zhang and Lingfei Wu

The growth dynamics of citation networks.
The growth dynamics of citation networks.

Like the fashion industry, sciences also experience the surge and decay of areas. From the perspective of attention dynamics, this is the natural consequence of the flow of scientists' collective attention of across different knowledge domains. Different from previous attempts that map the landscape of sciences directly by the topology of knowledge networks (in which nodes are papers or journals and edges are citations or reader-clickstreams), we used the singular vector decomposition (SVD) method to project the analyzed citation networks into a low-dimension Euclidean space. We find that the diffusion of attention in this pace explains 1) the super-linear, power-law growth of the number of citations against the number of papers; and 2) the exponential decay of the citing probability over time. We also show that this low-dimension Euclidean space projection of knowledge map allows us to predict the growth trend of different knowledge domains from their current status. To construct the citation networks we used 5 x 10^5 physics papers published in the past century and 1.3 x 10^5 computer science papers published in the past forty years.

4. Pattern Repeating and Breaking in Song Structure

Hua Xiao and Lingfei Wu

Cited from M. Small et al., Transforming Time Series into Complex Networks
Cited from M. Small et al., Transforming Time Series into Complex Networks

The emotional arousal and pleasure during music listening is a widely observed phenomenon but the mechanism behind it remained unsolved for many years. We propose that the emotional effect of a song is relevant to the information it carries. In particular, a balance between pattern repeating and breaking should be achieved for a song to bring pleasure feeling, which means that either no information or information overload are un-preferred extremes, although the optimal position between these two extremes may vary between different audience. In the current study we use networks to represent the structure of songs. In these networks nodes are repeated patterns and edges are time intervals between them. We analyze the hierarchy of these networks and propose a novel index N to quantify the novelty (symmetry-breaking) of songs. This metric is a fingerprint for personal taste of audience across music genres and thus is an important feature to be considered in personalized music recommendation.

Open Science is Possible

These projects are interesting by themselves, but their impact goes beyond the scientific problems they are addressing. I use these projects to show that, open-science is not only possible, but really a much better way to do science. I got to know the collaborators of the above-listed projects in Swarm Agents Club (SAC) (see below a brief introduction of SAC). These collaborative studies are zero-cost in terms of data, software, and human resource, and are open to the entire scientific community since the birth of scientific ideas.

Swarm Agents Club

Since 2008, we have been gathering a group of young Chinese scientists from different areas including physics, computer science, math, and biology to practice the idea of "open science", in particular, scientific collaboration outside universities. The effort of SAC in promoting interdisciplinary communication and collaboration in the past seven years established its high reputation in China.

Currently SAC is run by two groups of core members working together towards the same goal of promoting open science, 1) 11 SAC cores who are responsible for dealing with daily routine activities such as hosting study groups and seminars, and 2) 4 global scientific committee members who are responsible for formulating and recommending academic and planning goals and initiatives for the club.

Besides the continuous input in hosting seminars in a Cafe in Beijing and maintaining an email list of 500+ professional members, our products now include 1 book on artificial intelligence, 1 APP using deep learning technique to predict weather at minute-level and meter resolution, which is providing service for 10+ million users, and many high-impact peer-review papers (e.g., Scientific Reports, CVPR, etc).

The book published by SAC: [Frontiers in Artificial Intelligence](http://product.dangdang.com/23740304.html)
The book published by SAC: [Frontiers in Artificial Intelligence](http://product.dangdang.com/23740304.html)
The smartphone APP developed by SAC members: [Colorful Clouds](http://caiyunapp.com/)
The smartphone APP developed by SAC members: [Colorful Clouds](http://caiyunapp.com/)
The papers published by SAC members
The papers published by SAC members
Reference

[1] Wu L. and R. Ackland (2014), How Web1.0 fails: The mismatch between hyperlinks and clickstreams, Social Network Analysis and Mining, 4: 202 – 206.

[2] Wu L. (2011), The accelerating growth of online tagging systems, European Physical Journal B, 83(2): 283-287.

[3] Wu L. and J. Zhang (2011), Accelerating growth and size-dependent distribution of human online activities, Physical Review E, 84 (2): 026113-026117.

[4] Wu, L., J. Zhang, and M. Zhao (2014), The metabolism and growth of web forums, PLoS ONE, 9(8): e102646.

[5] Zhang J. and L. Wu (2013), Allometry and dissipation of ecological networks, PLoS ONE, 8(9): e72525.

[6] Zhang J., X. Li, X. Wang, W. Wang, L. Wu (2015), Scaling behaviors in the growth of networked systems and their geometric origins, Scientific Reports, 5: 9767.

[7] Wu L. and J. Zhang (2013), The decentralized structure of collective attention on the Web, European Physical Journal B, 86(6): 266-277.

[8] C. Wang, L. Wu, J. Zhang, M. Janssen (2015), The Hidden Geometry of Attention Diffusion, Under Review.

[9] L. Wu, J. Baggio, M. Janssen (2015), The Dynamics of Collaborative Knowledge Production, Under Review.

[10] L. Wu and M. Janssen (2015), Attention as A Limited Resource in Digital Commons, Working Paper.

最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
  • 序言:七十年代末,一起剥皮案震惊了整个滨河市,随后出现的几起案子,更是在滨河造成了极大的恐慌,老刑警刘岩,带你破解...
    沈念sama阅读 159,219评论 4 362
  • 序言:滨河连续发生了三起死亡事件,死亡现场离奇诡异,居然都是意外死亡,警方通过查阅死者的电脑和手机,发现死者居然都...
    沈念sama阅读 67,363评论 1 293
  • 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
    开封第一讲书人阅读 108,933评论 0 243
  • 文/不坏的土叔 我叫张陵,是天一观的道长。 经常有香客问我,道长,这世上最难降的妖魔是什么? 我笑而不...
    开封第一讲书人阅读 44,020评论 0 206
  • 正文 为了忘掉前任,我火速办了婚礼,结果婚礼上,老公的妹妹穿的比我还像新娘。我一直安慰自己,他们只是感情好,可当我...
    茶点故事阅读 52,400评论 3 287
  • 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
    开封第一讲书人阅读 40,640评论 1 219
  • 那天,我揣着相机与录音,去河边找鬼。 笑死,一个胖子当着我的面吹牛,可吹牛的内容都是我干的。 我是一名探鬼主播,决...
    沈念sama阅读 31,896评论 2 313
  • 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
    开封第一讲书人阅读 30,597评论 0 199
  • 序言:老挝万荣一对情侣失踪,失踪者是张志新(化名)和其女友刘颖,没想到半个月后,有当地人在树林里发现了一具尸体,经...
    沈念sama阅读 34,327评论 1 244
  • 正文 独居荒郊野岭守林人离奇死亡,尸身上长有42处带血的脓包…… 初始之章·张勋 以下内容为张勋视角 年9月15日...
    茶点故事阅读 30,581评论 2 246
  • 正文 我和宋清朗相恋三年,在试婚纱的时候发现自己被绿了。 大学时的朋友给我发了我未婚夫和他白月光在一起吃饭的照片。...
    茶点故事阅读 32,072评论 1 261
  • 序言:一个原本活蹦乱跳的男人离奇死亡,死状恐怖,灵堂内的尸体忽然破棺而出,到底是诈尸还是另有隐情,我是刑警宁泽,带...
    沈念sama阅读 28,399评论 2 253
  • 正文 年R本政府宣布,位于F岛的核电站,受9级特大地震影响,放射性物质发生泄漏。R本人自食恶果不足惜,却给世界环境...
    茶点故事阅读 33,054评论 3 236
  • 文/蒙蒙 一、第九天 我趴在偏房一处隐蔽的房顶上张望。 院中可真热闹,春花似锦、人声如沸。这庄子的主人今日做“春日...
    开封第一讲书人阅读 26,083评论 0 8
  • 文/苍兰香墨 我抬头看了看天上的太阳。三九已至,却和暖如春,着一层夹袄步出监牢的瞬间,已是汗流浃背。 一阵脚步声响...
    开封第一讲书人阅读 26,849评论 0 195
  • 我被黑心中介骗来泰国打工, 没想到刚下飞机就差点儿被人妖公主榨干…… 1. 我叫王不留,地道东北人。 一个月前我还...
    沈念sama阅读 35,672评论 2 274
  • 正文 我出身青楼,却偏偏与公主长得像,于是被迫代替她去往敌国和亲。 传闻我的和亲对象是个残疾皇子,可洞房花烛夜当晚...
    茶点故事阅读 35,585评论 2 270

推荐阅读更多精彩内容

  • **2014真题Directions:Read the following text. Choose the be...
    又是夜半惊坐起阅读 8,583评论 0 23
  • 上坟(平水韵) 文/清风 又见孤坟痛断肠,无情衰草掩亲娘。 随风又送冥钱去,魂梦可曾到故乡。 注:今天是农历十月初...
    清风2阅读 219评论 0 0
  • 北非,索马里,距摩加迪沙三十里之外。 夜 “巴克斯立上校!”无线电传出阵阵嘈杂的电流杂音,背后有着枪火声........
    誓言守夜阅读 244评论 0 1
  • 1.我对心理学感兴趣,读过一些心理学书籍《巨婴国》《梦的解析》《乌合之众》等。最近也读过《罗生门》《卡夫卡短篇小说...
    haperduharplass阅读 174评论 0 0
  • 每一次被伤害,就会缩回龟壳里,等熬过了难过期,就把头给又申出来。可是一次次的伤害便使自己难以忘怀。每伤害一次,便把...
    伤心蜀阅读 494评论 0 0