2012年1月7日土曜日

Twitter + 災害

Twitter in Disaster Mode:
http://people.ee.ethz.ch/~hossmath/papers/woid_twimight.pdf

Recent natural disasters (earthquakes, floods, etc.) have shown
that people heavily use platforms like Twitter to communicate and organize in emergencies. However, the fixed infrastructure supporting such communications may be temporarily wiped out. In such situations, the phones’ capabilities of
infrastructure-less communication can fill in: By propagating data opportunistically (from phone to phone), tweets can
still be spread, yet at the cost of delays.
In this paper, we present Twimight and its network security extensions. Twimight is an open source Twitter client
for Android phones featured with a “disaster mode”, which
users enable upon losing connectivity. In the disaster mode,
tweets are not sent to the Twitter server but stored on the
phone, carried around as people move, and forwarded via
Bluetooth when in proximity with other phones. However,
switching from an online centralized application to a distributed and delay-tolerant service relying on opportunistic
communication requires rethinking the security architecture.
We propose security extensions to offer comparable security in the disaster mode as in the normal mode to protect
Twimight from basic attacks. We also propose a simple,
yet efficient, anti-spam scheme to avoid users from being
flooded with spam. Finally, we present a preliminary empirical performance evaluation of Twimight.
Categories and Subject Descriptors

Twitter の情報信頼性

Information Credibility on Twitter
http://www.www2011india.com/proceeding/proceedings/p675.pdf


We analyze the information credibility of news propagated
through Twitter, a popular microblogging service. Previous
research has shown that most of the messages posted on
Twitter are truthful, but the service is also used to spread
misinformation and false rumors, often unintentionally.
On this paper we focus on automatic methods for assessing the credibility of a given set of tweets. Specifically, we
analyze microblog postings related to “trending” topics, and
classify them as credible or not credible, based on features
extracted from them. We use features from users’ posting
and re-posting (“re-tweeting”) behavior, from the text of the
posts, and from citations to external sources.
We evaluate our methods using a significant number of
human assessments about the credibility of items on a recent
sample of Twitter postings. Our results shows that there are
measurable differences in the way messages propagate, that
can be used to classify them automatically as credible or
not credible, with precision and recall in the range of 70%
to 80%

Twitter + イベント検出 (2)

TwitterMonitor: Trend Detection over the Twitter Stream
http://queens.db.toronto.edu/~mathiou//TwitterMonitor.pdf

We present TwitterMonitor, a system that performs trend
detection over the Twitter stream. The system identifies
emerging topics (i.e. ‘trends’) on Twitter in real time and
provides meaningful analytics that synthesize an accurate
description of each topic. Users interact with the system
by ordering the identified trends using different criteria and
submitting their own description for each trend.
We discuss the motivation for trend detection over social media streams and the challenges that lie therein. We
then describe our approach to trend detection, as well as
the architecture of TwitterMonitor. Finally, we lay out our
demonstration scenario.

X-RIME: Hadoop based large scale social network analysis

http://xrime.sourceforge.net/


Today's Internet-based social network sites possess huge user communities. They hold large amount of data about their users and want to generate core competency from the data. A key enabler for this is a cost efficient solution for social data management and social network analysis (SNA). Such a solution faces a few challenges. The most important one is that the solution should be able to handle massive and heterogeneous data sets. Facing this challenge, the traditional data warehouse based solutions are usually not cost efficient enough. On the other hand, existing SNA tools are mostly used in single workstation mode, and not scalable enough. To this end, low cost and highly scalable data management and processing technologies from cloud computing society should be brought in to help. However, most of existing cloud based data analysis solutions are trying to provide SQL-like general purpose query languages, and do not directly support social network analysis. This makes them hard to optimize and hard to use for SNA users. So, we came up with X-RIME to fix this gap. So, briefly speaking, X-RIME wants to provide a few value-added layers on top of existing cloud infrastructure, to support smart decision loops based on massive data sets and SNA. To end users, X-RIME is a library consists of Map-Reduce programs, which are used to do raw data pre-processing, transformation, SNA metrics and structures calculation, and graph / network visualization. The library could be integrated with other Hadoop based data warehouses (e.g., HIVE) to build more comprehensive solutions.

This project is a join effort of Beijing University of Posts and Telecommunications (BUPT) and IBM China Research Lab, supported by IBM Open Collaboration Research program. The code is open source under Apache License V2.0.
Currently Supported SNA Metrics and Structures

vertex degree statistics
weakly connected components (WCC)
strongly connected components (SCC)
bi-connected components (BCC)
ego-centric network density
bread first search / single source shortest path (BFS/SSSP)
K-core
maximal cliques
pagerank
hyperlink-induced topic search (HITS)
minimal spanning tree (MST)
grid variant of Fruchterman-Reingold network layout algorithm

ZAME: Interactive Large-Scale Graph Visualization

http://www.aviz.fr/~fekete/ps/zame.pdf


We present the Zoomable Adjacency Matrix Explorer (ZAME), a
visualization tool for exploring graphs at a scale of millions of
nodes and edges. ZAME is based on an adjacency matrix graph
representation aggregated at multiple scales. It allows analysts to
explore a graph at many levels, zooming and panning with interactive performance from an overview to the most detailed views.
Several components work together in the ZAME tool to make this
possible. Efficient matrix ordering algorithms group related elements. Individual data cases are aggregated into higher-order metarepresentations. Aggregates are arranged into a pyramid hierarchy that allows for on-demand paging to GPU shader programs
to support smooth multiscale browsing. Using ZAME, we are
able to explore the entire French Wikipedia—over 500,000 articles and 6,000,000 links—with interactive performance on standard
consumer-level computer hardware

生物学的ネットワークへのグラフ技術の応用

[GEXF] Diseasome: 既知の障害遺伝子との関連によって結び付けられた障害/疾患遺伝子のネットワークで、多くの疾病の遺伝的原因が示されています。類似する障害に関連する遺伝子では、生成物質間の物理的相互作用発生の可能性が高いと当時に、転写の発現プロファイリングの類似性も高いことが示されています。オリジナルデータセットはここにあります。The Human Disease Network, Goh K-I, Cusick ME, Valle D, Childs B, Vidal M, Barabási A-L (2007), Proc Natl Acad Sci USA 104:8685-8690
[GEXF] C. Elegans の神経網: C. Elegans (線虫の一種) の神経網を表した、重み付けされた有向ネットワーク。D. Watts と S. Strogatz によって作成されたデータは Web から入手することができ、ここにあります。引用時には次の出典を明記してください: D. J. Watts and S. H. Strogatz, Nature 393, 440-442 (1998)。オリジナルの実験データの出所: J. G. White, E. Southgate, J. N. Thompson, and S. Brenner, Phil. Trans. R. Soc. London 314, 1-340 (1986).
[GEXF] イースト: イースト菌のタンパク質間相互作用。オリジナルデータはここにあります。
[訳注:原文に欠落部分があるようです]オリジナルデータはここにあります。

コード解析へのグラフ技術の応用

http://oss.infoscience.co.jp/gephi/wiki.gephi.org/index.php/Datasets.html
[GEXF] Java コード: Java プログラムのソースコード構造。S.Heymann & J.Palmier, 2008 による。
[GEXF] 動的 Java コード: SVN 上でのコミットの進行による Java プログラムの動的ソースコード構造。S.Heymann & J.Bilcke, 2008 による。
[TGZ] Github オープンソース開発者: http://lumberjaph.net/blog/index.php/2010/03/25/github-explorer/ を参照してください。

スマートグリッド

http://oss.infoscience.co.jp/gephi/wiki.gephi.org/index.php/Datasets.html
電力網: 重み付けのない無向ネットワークで、米国西部諸州電力網のトポロジーを表しています。D. Watts と S. Strogatz によって作成されたデータは Web から入手することができ、ここにあります。引用時には次の出典を明記してください: D. J. Watts and S. H. Strogatz, Nature 393, 440-442 (1998)。

Gephi

http://oss.infoscience.co.jp/gephi/gephi.org/plugins/graph-streaming/index.html
http://gephi.org/blog/

The purpose of the Graph Streaming API is to build a unified framework for streaming graph objects. Gephi’s data structure and visualization engine has been built with the idea that a graph is not static and might change continuously. By connecting Gephi with external data-sources, we leverage its power to visualize and monitor complex systems or enterprise data in real-time. Moreover, the idea of streaming graph data goes beyond Gephi, and a unified and standardized API could bring interoperability with other available tools for graph and network analysis, as they could start to interoperate with other tools in a distributed and cooperative fashion.

Data Set is available at
http://oss.infoscience.co.jp/gephi/wiki.gephi.org/index.php/Datasets.html

Twitter +

Twitter Power: Tweets as Electronic Word of Mouth
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3321

In this paper we report research results investigating microblogging as a form of electronic word-of-mouth for sharing consumer opinions concerning brands. We analyzed more than 150,000 microblog postings containing branding comments, sentiments, and opinions.We investigated the overall structure of these microblog postings, the types of expressions, and the movement in positive or negative sentiment.We compared automated methods of classifying sentiment in these microblogs with manual coding. Using a case study approach, we analyzed the range, frequency, timing, and content of tweets in a corporate account. Our research findings show that 19% of microblogs contain mention of a brand. Of the branding microblogs, nearly 20 % contained some expression of brand sentiments. Of these, more than 50 % were positive and 33 % were critical of the company or product. Our comparison of automated and manual coding showed no significant differences between the two approaches. In analyzing microblogs for structure and composition, the linguistic structure of tweets approximate the linguistic patterns of natural language expressions. We find that microblogging is an online tool for customer word of mouth communications and discuss the implications for corporations using microblogging as part of their overall marketing strategy.

Twitter + 感情分析 (金融への応用含む)

Twitter mood predicts the stock market

http://arxiv.org/abs/1010.3003

Behavioral economics tells us that emotions can profoundly affect individual behavior and decision-making. Does this also apply to societies at large, i.e., can societies experience mood states that affect their collective decision making? By extension is the public mood correlated or even predictive of economic indicators? Here we investigate whether measurements of collective mood states derived from large-scale Twitter feeds are correlated to the value of the Dow Jones Industrial Average (DJIA) over time. We analyze the text content of daily Twitter feeds by two mood tracking tools, namely OpinionFinder that measures positive vs. negative mood and Google-Profile of Mood States (GPOMS) that measures mood in terms of 6 dimensions (Calm, Alert, Sure, Vital, Kind, and Happy). We cross-validate the resulting mood time series by comparing their ability to detect the public's response to the presidential election and Thanksgiving day in 2008. A Granger causality analysis and a Self-Organizing Fuzzy Neural Network are then used to investigate the hypothesis that public mood states, as measured by the OpinionFinder and GPOMS mood time series, are predictive of changes in DJIA closing values. Our results indicate that the accuracy of DJIA predictions can be significantly improved by the inclusion of specific public mood dimensions but not others. We find an accuracy of 87.6% in predicting the daily up and down changes in the closing values of the DJIA and a reduction of the Mean Average Percentage Error by more than 6%.



Younggue Bae , Hongchul Lee, A sentiment analysis of audiences on twitter: who is the positive or negative audience of popular twitterers?, Proceedings of the 5th international conference on Convergence and hybrid information technology, September 22-24, 2011, Daejeon, Korea
http://dl.acm.org/citation.cfm?id=1944594&CFID=76892041&CFTOKEN=90820401

Automated identification of diverse sentiment types can be beneficial for many NLP systems such as review summarization and public media analysis. In some of these systems there is an option of assigning a sentiment value to a single sentence or a very short text.In this paper we propose a supervised sentiment classification framework which is based on data from Twitter, a popular microblogging service. By utilizing 50 Twitter tags and 15 smileys as sentiment labels, this framework avoids the need for labor intensive manual annotation, allowing identification and classification of diverse sentiment types of short texts. We evaluate the contribution of different feature types for sentiment classification and show that our framework successfully identifies sentiment types of untagged sentences. The quality of the sentiment identification was also confirmed by human judges. We also explore dependencies and overlap between different sentiment types represented by smileys and Twitter hashtags.
http://dl.acm.org/citation.cfm?id=1944594&CFID=76892041&CFTOKEN=90820401


Effective sentiment stream analysis with self-augmenting training and demand-driven projection
http://dl.acm.org/citation.cfm?id=2009981&CFID=76892041&CFTOKEN=90820401
How do we analyze sentiments over a set of opinionated Twitter messages? This issue has been widely studied in recent years, with a prominent approach being based on the application of classification techniques. Basically, messages are classified according to the implicit attitude of the writer with respect to a query term. A major concern, however, is that Twitter (and other media channels) follows the data stream model, and thus the classifier must operate with limited resources, including labeled data for training classification models. This imposes serious challenges for current classification techniques, since they need to be constantly fed with fresh training messages, in order to track sentiment drift and to provide up-to-date sentiment analysis.

We propose solutions to this problem. The heart of our approach is a training augmentation procedure which takes as input a small training seed, and then it automatically incorporates new relevant messages to the training data. Classification models are produced on-the-fly using association rules, which are kept up-to-date in an incremental fashion, so that at any given time the model properly reflects the sentiments in the event being analyzed. In order to track sentiment drift, training messages are projected on a demand driven basis, according to the content of the message being classified. Projecting the training data offers a series of advantages, including the ability to quickly detect trending information emerging in the stream. We performed the analysis of major events in 2010, and we show that the prediction performance remains about the same, or even increases, as the stream passes and new training messages are acquired. This result holds for different languages, even in cases where sentiment distribution changes over time, or in cases where the initial training seed is rather small. We derive lower-bounds for prediction performance, and we show that our approach is extremely effective under diverse learning scenarios, providing gains that range from 7% to 58%.


Taketoshi Ushiama , Tomoya Eguchi, An information recommendation agent on microblogging service, Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications, June 29-July 01, 2011, Manchester, UK

Bernard J. Jansen , Kate Sobel , Geoff Cook, Gen X and Ys attitudes on using social media platforms for opinion sharing, Proceedings of the 28th of the international conference extended abstracts on Human factors in computing systems, April 10-15, 2010, Atlanta, Georgia, USA

Tiffany C. Chao, Data repositories: a home for microblog archives?, Proceedings of the 2011 iConference, p.655-656, February 08-11, 2011, Seattle, Washington

Wei Wu , Bin Zhang , Mari Ostendorf, Automatic generation of personalized annotation tags for Twitter users, Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, p.689-692, June 02-04, 2010, Los Angeles, California

Daniel M. Romero , Wojciech Galuba , Sitaram Asur , Bernardo A. Huberman, Influence and passivity in social media, Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases, September 05-09, 2011, Athens, Greece

Younggue Bae , Hongchul Lee, A sentiment analysis of audiences on twitter: who is the positive or negative audience of popular twitterers?, Proceedings of the 5th international conference on Convergence and hybrid information technology, September 22-24, 2011, Daejeon, Korea

Kamran Massoudi , Manos Tsagkias , Maarten de Rijke , Wouter Weerkamp, Incorporating query expansion and quality indicators in searching microblog posts, Proceedings of the 33rd European conference on Advances in information retrieval, April 18-21, 2011, Dublin, Ireland

Bernard J. Jansen , Kate Sobel , Geoff Cook, Being networked and being engaged: the impact of social networking on ecommerce information behavior, Proceedings of the 2011 iConference, p.130-136, February 08-11, 2011, Seattle, Washington

Dmitry Davidov , Oren Tsur , Ari Rappoport, Enhanced sentiment learning using Twitter hashtags and smileys, Proceedings of the 23rd International Conference on Computational Linguistics: Posters, p.241-249, August 23-27, 2010, Beijing, China

Claudia Wagner , Markus Strohmaier, The wisdom in tweetonomies: acquiring latent conceptual structures from social awareness streams, Proceedings of the 3rd International Semantic Search Workshop, p.1-10, April 26-26, 2010, Raleigh, North Carolina

Matthew Michelson , Sofus A. Macskassy, Discovering users' topics of interest on twitter: a first look, Proceedings of the fourth workshop on Analytics for noisy unstructured text data, October 26-26, 2010, Toronto, ON, Canada

Surender Reddy Yerva , Zoltán Miklós , Karl Aberer, What have fruits to do with technology?: the case of Orange, Blackberry and Apple, Proceedings of the International Conference on Web Intelligence, Mining and Semantics, May 25-27, 2011, Sogndal, Norway

Jingtao Wang , Shumin Zhai , John Canny, SHRIMP: solving collision and out of vocabulary problems in mobile predictive input with motion gesture, Proceedings of the 28th international conference on Human factors in computing systems, April 10-15, 2010, Atlanta, Georgia, USA

Takeshi Sakaki , Makoto Okazaki , Yutaka Matsuo, Earthquake shakes Twitter users: real-time event detection by social sensors, Proceedings of the 19th international conference on World wide web, April 26-30, 2010, Raleigh, North Carolina, USA

Sheila Kinsella , Mengjiao Wang , John G. Breslin , Conor Hayes, Improving categorisation in social media using hyperlinks to structured data sources, Proceedings of the 8th extended semantic web conference on The semanic web: research and applications, May 29-June 02, 2011, Heraklion, Crete, Greece

Jennifer Golbeck , Justin M. Grimes , Anthony Rogers, Twitter use by the U.S. Congress, Journal of the American Society for Information Science and Technology, v.61 n.8, p.1612-1621, August 2010

Jun Huang , Mizuho Iwaihara, Realtime social sensing of support rate for microblogging, Proceedings of the 16th international conference on Database systems for advanced applications, April 22-25, 2011, Hong Kong, China

Makoto Okazaki , Yutaka Matsuo, Semantic twitter: analyzing tweets for real-time event notification, Proceedings of the 2008/2009 international conference on Social software: recent trends and developments in social software, p.63-74, March 03-04, 2008, Cork, Ireland

Thomas Heverin , Lisl Zach, Twitter for city police department information sharing, Proceedings of the 73rd ASIS&T Annual Meeting on Navigating Streams in an Information Ecosystem, October 22-27, 2010, Pittsburgh, Pennsylvania

Pedro Henrique Calais Guerra , Adriano Veloso , Wagner Meira, Jr. , Virgílio Almeida, From bias to opinion: a transfer-learning approach to real-time sentiment analysis, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, August 21-24, 2011, San Diego, California, USA

Miles Efron , Megan Winget, Questions are content: a taxonomy of questions in a microblogging environment, Proceedings of the 73rd ASIS&T Annual Meeting on Navigating Streams in an Information Ecosystem, October 22-27, 2010, Pittsburgh, Pennsylvania

Anlei Dong , Ruiqiang Zhang , Pranam Kolari , Jing Bai , Fernando Diaz , Yi Chang , Zhaohui Zheng , Hongyuan Zha, Time is of the essence: improving recency ranking using Twitter data, Proceedings of the 19th international conference on World wide web, April 26-30, 2010, Raleigh, North Carolina, USA

Yegin Genc , Yasuaki Sakamoto , Jeffrey V. Nickerson, Discovering context: classifying tweets through a semantic transform based on wikipedia, Proceedings of the 6th international conference on Foundations of augmented cognition: directing the future of adaptive systems, July 09-14, 2011, Orlando, FL

Evangelos Kalampokis , Michael Hausenblas , Konstantinos Tarabanis, Combining social and government open data for participatory decision-making, Proceedings of the Third IFIP WG 8.5 international conference on Electronic participation, August 29-September 01, 2011, Delft, The Netherlands

Ismael Santana Silva , Janaína Gomide , Adriano Veloso , Wagner Meira, Jr. , Renato Ferreira, Effective sentiment stream analysis with self-augmenting training and demand-driven projection, Proceedings of the 34th international ACM SIGIR conference on Research and development in Information, July 24-28, 2011, Beijing, China

Bernard J. Jansen , Zhe Liu , Courtney Weaver , Gerry Campbell , Matthew Gregg, Real time search on the web: Queries, topics, and economic value, Information Processing and Management: an International Journal, v.47 n.4, p.491-506, July, 2011

Marti Motoyama , Brendan Meeder , Kirill Levchenko , Geoffrey M. Voelker , Stefan Savage, Measuring online service availability using twitter, Proceedings of the 3rd conference on Online social networks, p.13-13, June 22-25, 2010, Boston, MA

Zi Chu , Steven Gianvecchio , Haining Wang , Sushil Jajodia, Who is tweeting on Twitter: human, bot, or cyborg?, Proceedings of the 26th Annual Computer Security Applications Conference, December 06-10, 2010, Austin, Texas

Mike Thelwall , Kevan Buckley , Georgios Paltoglou, Sentiment in Twitter events, Journal of the American Society for Information Science and Technology, v.62 n.2, p.406-418, February 2011

Laurens De Vocht , Selver Softic , Martin Ebner , Herbert Mühlburger, Semantically driven social data aggregation interfaces for Research 2.0, Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies, September 07-09, 2011, Graz, Austria

Twitter + イベント検出

Extracting Events and Event Descriptions from Twitter
http://www.www2011india.com/proceeding/companion/p105.pdf

This paper describes methods for automatically detecting events
involving known entities from Twitter and understanding both the
events as well as the audience reaction to them. We show that NLP
techniques can be used to extract events, their main actors and the
audience reactions with encouraging results.


Earthquake Shakes Twitter Users:Real-time Event Detection by Social Sensors
http://ymatsuo.com/papers/www2010.pdf


Streaming First Story Detection with application to Twitter
http://aclweb.org/anthology/N/N10/N10-1021.pdf

With the recent rise in popularity and size of
social media, there is a growing need for systems that can extract useful information from
this amount of data. We address the problem of detecting new events from a stream of
Twitter posts. To make event detection feasible on web-scale corpora, we present an algorithm based on locality-sensitive hashing which is able overcome the limitations of traditional
approaches, while maintaining competitive results. In particular, a comparison with a stateof-the-art system on the first story detection
task shows that we achieve over an order of
magnitude speedup in processing time, while
retaining comparable performance. Event detection experiments on a collection of 160 million Twitter posts show that celebrity deaths
are the fastest spreading news on Twitter.


Detecting Controversial Events from Twitter
http://www.marcopennacchiotti.com/pro/publications/CIKM_2010.pdf
Social media provides researchers with continuously updated
information about developments of interest to large audi-
ences. This paper addresses the task of identifying contro-
versial events using Twitter as a starting point: we propose
3 models for this task and report encouraging initial results.


以下、http://hashimomau.chips.jp/weblogs/?page_id=182より抜粋

題名:Why We Twitter: Understanding Microblogging Usage and Communities
出典:Joint 9th WEBKDD and 1st SNA-KDD Workshop ’07
概要・特徴:
twitterを分析した論文(初期なのでは??)
twitterユーザの世界分布、ユーザ数の増加など
twitterユーザの行動分析
ユーザは情報収集、日常の他愛もないつぶやき、他のユーザとのコミュニケーションをしている
HITSアルゴリズムを用いてコミュニティ分析もしている
感想:この論文は引用されることが多く、twitterを研究される方は取りあえず、読んでおくと良いです!
リンク:http://ebiquity.umbc.edu/paper/html/id/367/Why-We-Twitter-Understanding-Microblogging-Usage-and-Communities
題名:TwitterRank:Finding Topic-sensitive Influential Twitterers
出典:WSDM 2010
概要・特徴:
Twitter内の有力なユーザを抽出する方法を提案
TwitterRank:ページランクのアルゴリズムを拡張して実現。実験の結果より、他のアルゴリズムと比較して良い評価を得た
Twitterユーザに“homophily”が存在することを示し、“フォロー”関係に趣向(話題)の類似性があることを証明した
感想:フォロー関係に話題の類似性があることを学術的?統計的に示した論文。技術系論文では初らしい。PageRankを用いているため、有力ユーザ(有名ユーザ)の検出には効果がありそう。しかし、どの辺がTopic-sensitiveなのか分からなかったです。
リンク:http://www.mysmu.edu/staff/jsweng/papers/TwitterRank_WSDM.pdf


題名:Predicting Elections with Twitter: What 140 Characters Reveal about Political Sentiment
出典:Proceedings of the Fourth International AAAI Conference on Weblogs and Social Media 2010
概要・特徴:
twitter×選挙(政治)の関係を示した論文
twitterの投稿数とドイツ議会選挙との関係を調査した論文(投稿数から選挙結果を予想している)
LIWC(投稿の感情を分析するツール)を用いてセンチメント分析し、当時の政治状況と考察している
感想:投稿数から選挙結果を導けるかどうか疑問。しかし、選挙とtwitterの投稿を自然言語処理を用いて導いていると論文は初?投稿(ドイツ語)→英語に変換→LIWC(投稿の感情を分析するツール)を用いている。これはドイツ語と英語の互換性が高いから出来る事。日本語じゃ無理ぽ。 ※日本だとWEBと政治の関係を示した論文が極端に少ない気がします。
リンク: http://videolectures.net/icwsm2010_sprenger_pet/
題名:Tweet the Debates Understanding Community Annotation of Uncollected Sources
出典:WSM’09
概要・特徴:
アメリカ大統領選挙中の党首討論の議論の流れと、同時期のtwitterの議論の流れを解析した研究
twitterの投稿から動画のアノテーションを試みる研究
党首討論はTV放送で中継されており、中継中の字幕放送を議論の流れとしている
twitterの投稿は、ハッシュタグを使用しているtweetなどを利用している
感想:投稿からアノテーションをする研究は興味深かったです。
リンク: http://videolectures.net/icwsm2010_sprenger_pet/
題名:Microblogging During Two Natural Hazards Events: What Twitter May Contribute to Situational Awareness
出典:CHI 2010: Crisis Informatics
概要・特徴:
マイクロブログの性質を利用して災害時における情報伝播のメカニズム?を調べた研究
実際の災害時におけるデータを使用している
the Oklahoma Grassfires of April 2009 and the Red River Floods that occurred in March and April 2009
感想:災害時にマイクロブログのリアルタイム性の高さが役つということが分かった論文。具体的な手法は覚えてないが、そのような結論だったはず。マイクロブログの特徴が社会に役に立つと思った論文でした。
リンク: http://delivery.acm.org/10.1145/1760000/1753486/p1079-vieweg.pdf?key1=1753486&key2=5717842921&coll=DL&dl=ACM&CFID=2537635&CFTOKEN=65603928
題名:Twitter mood predicts the stock market.
出典:今後どこかに投稿するらしい 2010現在
概要・特徴:
Twitterの投稿からNYダウ平均株価(DJIA)のアップダウンを87.6%の精度で予測
解析対象
We only take into account tweets that contain explicit statements of their author’s mood states.
“I feel”, “i am feeling”, “i’m feeling”, “i don’t feel”, “I’m”, “Im”, “I am”, and “makes me”.
上記解析対象をP/N(肯定/否定)判定器のOpinionFinder(OF)とセンチメント分析器のGoogle-Profile of Mood States(GPOMS)両者の差分値を示した
GPOMSは投稿を Calm, Alert, Sure, Vital, Kind, Happy に分類できる
また、両解析結果を2つの市場予想モデル?に適応している
Bivariate Granger Causality Analysis 、Self-organizing Fuzzy Neural Network (SOFNN) モデル
SOFNNモデルCalmに着目することで、 87.6%の精度を実現した

2012年1月6日金曜日

Twitter + 医療

Towards detecting influenza epidemics by analyzing Twitter messages
http://snap.stanford.edu/soma2010/papers/soma2010_16.pdf

Rapid response to a health epidemic is critical to reduce loss
of life. Existing methods mostly rely on expensive surveys
of hospitals across the country, typically with lag times of
one to two weeks for influenza reporting, and even longer
for less common diseases. In response, there have been
several recently proposed solutions to estimate a population’s health from Internet activity, most notably Google’s
Flu Trends service, which correlates search term frequency
with influenza statistics reported by the Centers for Disease
Control and Prevention (CDC). In this paper, we analyze
messages posted on the micro-blogging site Twitter.com to
determine if a similar correlation can be uncovered. We
propose several methods to identify influenza-related messages and compare a number of regression models to correlate these messages with CDC statistics. Using over 500,000
messages spanning 10 weeks, we find that our best model
achieves a correlation of .78 with CDC statistics by leveraging a document classifier to identify relevant messages.



Twitter Catches The Flu: Detecting Influenza Epidemics using Twitter
http://www.aclweb.org/anthology/D/D11/D11-1145.pdf



With the recent rise in popularity and  scale 
of social media, a growing need exists for 
systems  that can extract useful information 
from huge amounts of data. We address the 
issue  of  detecting  influenza  epidemics. 
First, the proposed system extracts influenza related tweets using Twitter API. Then, 
only tweets that mention actual influenza 
patients are extracted by the support vector 
machine (SVM) based classifier. The experiment results demonstrate the feasibility 
of the proposed approach (0.89 correlation 
to the gold standard). Especially at the outbreak and early spread (early epidemic 
stage), the proposed method shows high 
correlation  (0.97 correlation), which  outperforms the  state-of-the-art methods. This 
paper describes that Twitter texts reflect 
the real world, and that NLP techniques 
can  be applied to extract only  tweets that 
contain useful information.

TWITTER IMPROVES SEASONAL INFLUENZA PREDICTION
http://www.cs.uml.edu/~hachreka/SNEFT/images/healthinf_2012.pdf

Data Set To be Potentially Purchased

MySpace User Activity Stream: User count by lat/long
http://www.infochimps.com/datasets/myspace-user-activity-stream-user-count-by-latlong
The data is derived from the MySpace real-time stream API. It contains all of the users in the dataset, around 11 million, with well-formed latitude and longitude.


ClueWeb 2009
http://lemurproject.org/clueweb09.php/

2011年12月31日土曜日

ANUChem

X10-based SDP など X10 関係者に関係するページ

計算化学に関係する X10 ベースの計算ライブラリ
http://cs.anu.edu.au/~Josh.Milthorpe/anuchem.html
ソースコードも公開されています。

上記に関係する論文は以下の IPDPSの論文。
X10 as a parallel language for scientific computation: practice and experience
http://cs.anu.edu.au/~Josh.Milthorpe/publications/Milthorpe2011_IPDPS.pdf

2011年12月23日金曜日

Near-term Target Conferences

IPDPS2012 併設ワークショップ
2012 International Workshop on High Performance Data Intensive Computing(HPDIC2012)
http://cloud.hdu.edu.cn/HPDIC2012/
締め切り:2012/01/08
Research Contents: StreamGPU (Matsuura)



IPDPS2012 併設ワークショップ
ParLearning 2012
https://researcher.ibm.com/researcher/view_project.php?id=2591
- Real-time solutions for learning algorithms on parallel platforms
Due: 2012/01/18
Notification: 2012/02/01
Research Contents:
- StreamGPU (Morita and Ueno)
- Bipartite Graph

SYSTOR 2012
http://www.research.ibm.com/haifa/conferences/systor2012/dates.shtml
Due: 2012/2/13
Notification: 2012/3/26


IEEE CLOUD 2012
- VCTLPerf + Linear Road Benchmark
- Graph500 on Amazon EC2
Submission Deadline: February 10, 2012
Full Paper Submission Due Date: February 15, 2012
Decision Notification (Electronic): March 15, 2012



HPDC 2012
http://www.hpdc.org/2012/home/important-dates/
- Graph500 (Ueno)
- StreamGPU : GPU Task Parallelism (Ueno)
Abstracts Due: 16 January 2012
Papers Due: 23 January 2012, 11:59 PM Pacific Standard Time
Author Notifications: 19 March 2012

SACSIS 2012 (Domestic Conference)
http://sacsis.hpcc.jp/2012/
- StreamGPU (Ueno)
- StreamAPU (Matsuura)
- I-GIMV (Ganse)
- Incremental Spectral Clustering (Nishii)
- SDP with X10 (Watanabe)
Due: 2012/1/20
Notification: 2012/3


PLDI X10 Workwhop
http://x10-lang.org/workshop
Paper submission deadline: February 28, 2012
Author Notification: March 28, 2012
- X10-based X10 : Watanabe
- Performance Evaluation of X10-based Graph Algorithms on TSUBAME: Hashikawa and Watanabe

EuroPar 2012
http://europar2012.cti.gr/
Deadline for abstracts: January 31, 2012
Deadline for full papers: February 7, 2012
Decision notification: May 11, 2012

Supercomputing 2012
http://sc12.supercomputing.org/
- Graph500 (Ueno) (It depends on the result of HPDC)

Winter Simulation Conference 2012
http://www.wintersim.org/futureconf.htm
- Due: 2012/4
- Notification: 2012/6
- X10-based Large simulation platform

ACM Middleware Conferece
http://2011.middleware-conference.org/
- Due: 2012/5

IEEE IISWC 2012
- Due: 2012/6

2011年12月19日月曜日

The Fourth Paradigm: Data-Intensive Scientific Discovery

昨今注目されている書籍
http://research.microsoft.com/en-us/collaboration/fourthparadigm/

Of Hammers and Nails: An Empirical Comparison of Three Paradigms for Processing Large Graphs

マイクロソフトの新たなグラフ処理の論文。

Of Hammers and Nails: An Empirical Comparison of Three Paradigms for Processing Large Graphs
http://research.microsoft.com/pubs/155533/paper.pdf

Many phenomena and artifacts such as road networks, social networks and the web can be modeled as large graphs and analyzed
using graph algorithms. However, given the size of the underlying
graphs, efficient implementation of basic operations such as connected component analysis, approximate shortest paths, and linkbased ranking (e.g.PageRank) becomes challenging.
This paper presents an empirical study of computations on such
large graphs in three well-studied platform models, viz., a relational
model, a data-parallel model, and a special-purpose in-memory
model. We choose a prototypical member of each platform model
and analyze the computational efficiencies and requirements for
five basic graph operations used in the analysis of real-world graphs
viz., PageRank, SALSA, Strongly Connected Components (SCC),
Weakly Connected Components (WCC), and Approximate Shortest Paths (ASP). Further, we characterize each platform in terms of
these computations using model-specific implementations of these
algorithms on a large web graph. Our experiments show that there
is no single platform that performs best across different classes of
operations on large graphs. While relational databases are powerful and flexible tools that support a wide variety of computations,
there are computations that benefit from using special-purpose storage systems and others that can exploit data-parallel platforms

2011年12月17日土曜日

2部グラフ関連性解析の高速化およびシステムプロファイリング

- GPGPU による高速化
- システムプロファイリング:どこにどのぐらい時間を費やしているのか?
- 下位の基盤をSystem S 非依存にし、TSUBAME で大規模実行できるようにする

アプリケーション屋の要件

アプリ屋の requirement および実際に使っている手法等を知るため、情報交換の場をセットしていきましょう。
候補としては、まず上がるのが、東大松尾先生、東大鹿島先生、東工大杉山先生、IBM TRLのデータマイニング屋でお客様案件を担当している研究者など。

MovieLens

土屋さんの指導教官:横浜国立大学の長尾先生
http://www.nlab.sogo1.ynu.ac.jp/ynu/members/nagao.html
ネット企業との共同研究

MovieLens (映画に対する Rating) というデータセットを使って協調フィルタリング+ベイジアンネットを使って解析
http://www.grouplens.org/node/73

2011年12月14日水曜日

Random Walks on Directed and Undirected Graphs

http://www.math.ucsd.edu/~phorn/math261/

Random walk with restart に対する高速な Top-k 検索

Random walk with restart に対する高速な Top-k 検索
db-event.jpn.org/deim2011/proceedings/pdf/d3-1.pdf

2011年12月13日火曜日

An In-Depth Study of Stochastic Kronecker Graphs

ICDM に参加中の村田先生からのメッセージ。

"An In-Depth Study of Stochastic Kronecker Graphs"
C. Seshadhri, Ali Pinar, and Tamara G. Kolda,
Proceedings of the 11th IEEE International Conference on
Data Mining, pp.587-596, 2011.
http://arxiv.org/abs/1102.5046

タイトルの通り、(Graph500で用いられる)Kronecker Graphの研究です。発表を聞いただけで論文はまだ読んでいないのですが、
・次数分布はheavy tailでもpower lawでもなく、論文中の図の
ように何度もバウンドしたような曲線になる
・ノイズを入れたnoisy SKGになると次数分布が直線に近づく
・孤立点が多い。k=42で74%が孤立点
・coreのサイズは実ネットワークのそれより小さい

MLG 2010 Workshop

http://www.cs.purdue.edu/mlg2011/speakers.html

RAMGRAPH: large scale graph processing in RAMCloud

http://code.google.com/p/ramgraph/

Recently, the pay-as-you-go computing paradigm in public clouds such as Amazon EC2 offers users to execute their computational tasks on the rented virtualized computation resources. Due to the lower cost than hosting a private cloud, this paradigm has become popular for medium- and small-sized Web companies such as Alexa and SmugMug. Mining and processing the large web and social networks is one of the common regular tasks for those Web companies. For example, a search engine typically uses a graph-based ranking scheme such as PageRank to give an order to the pages. Moreover, those mining and processing tasks are highly customized with various user-defined logics applied on the entire graph. The requirement of high efficiency in large scale graph processing challenges existing tools. This is because, most of current tools such as MapReduce and Hadoop are disk-based, where the hard disk is typically 100-1000x slower than the main memory. The random access nature of graph processing further harnesses the performance of disk-based graph processing. The low efficiency of current disk-based systems limits the popularity of graph mining and business intelligence in Web companies, and can result in low utilization of existing investment and lose potential business opportunities.

To unleash the computation power of current cloud offerings, we propose Thunder, a large graph processing system in the main memories of hundreds or thousands of machines. Thunder stores and processes graphs entirely in the main memory, and uses hard disks only for backup and archrivals. The system provides APIs similar to Map and Reduce functions in MapReduce for users to implement their user-defined logics. These logics are automatically executed on the graph in a distributed manner.

The goal of designing and implementing Thunder is to exploit the advantage of in-memory processing, while remaining all the merits of conventional disk-based tools, namely excellent scalability, good fault-tolerance and ability of expressing arbitrary and complex customized logic. In particular, we are facing challenging issues like scalability, availability, complex memory management, network traffic reducing and so on.

Polonium: Tera-Scale Graph Mining and Inference for Malware Detection

http://siam.omnibooksonline.com/2011datamining/data/papers/052.pdf

We present Polonium, a novel Symantec technology
that detects malware through large-scale graph infer-
ence. Based on the scalable Belief Propagation algo-
rithm, Polonium infers every le's reputation,
agging
les with low reputation as malware. We evaluated
Polonium with a billion-node graph constructed from
the largest le submissions dataset ever published (60
terabytes). Polonium attained a high true positive rate
of 87% in detecting malware; in the eld, Polonium
lifted the detection rate of existing methods by 10 ab-
solute percentage points. We detail Polonium's design
and implementation features instrumental to its success.
Polonium has served 120 million people and helped an-
swer more than one trillion queries for le reputation.

Router: A Message Passing Model for Large-Scale Graph Mining

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6079403&tag=1

ABSTRACT

many parallel computational models have been employed in many papers to process the large-scale graph. In this paper, we propose a message passing model Router which could be invoked by most of current parallel computational models to process the large graph. The model is good at solving the multi-source traversal problem which often occurs in many complex graph algorithms. As the model can traverse the graph from different source at the same time, the multi-source traversal will finish in much less iteration than before. In this way, the total time of the algorithm involves multi-source traversal will be reduced in a large scale. Besides, the Router model is flexible enough to express a broad set of algorithms by implementing the Router's abstract method. Finally, the experiment shows the efficiency and scalability of the model.

Router: A Message Passing Model for Large-Scale Graph Mining

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6079403&tag=1

Large-Scale Graph Mining Using Backbone Refinement Classes

We present a new approach to large-scale graph mining
based on so-called backbone refinement classes. The method
efficiently mines tree-shaped subgraph descriptors under minimum frequency and significance constraints, using classes
of fragments to reduce feature set size and running times.
The classes are defined in terms of fragments sharing a common backbone. The method is able to optimize structural
inter-feature entropy as opposed to occurrences, which is
characteristic for open or closed fragment mining. In the
experiments, the proposed method reduces feature set sizes
by >90 % and >30 % compared to complete tree mining and
open tree mining, respectively. Evaluation using crossvalidation runs shows that their classification accuracy is similar to the complete set of trees but significantly better than
that of open trees. Compared to open or closed fragment
mining, a large part of the search space can be pruned due
to an improved statistical constraint (dynamic upper bound
adjustment), which is also confirmed in the experiments in
lower running times compared to ordinary (static) upper
bound pruning. Further analysis using large-scale datasets
yields insight into important properties of the proposed descriptors, such as the dataset coverage and the class size
represented by each descriptor. A final cross-validation run
confirms that the novel descriptors render large training sets
feasible which previously might have been intractable.