Discovering company revenue relations from news: A network approach

被引:36
作者
Ma, Zhongming [1 ]
Sheng, Olivia R. L. [3 ]
Pant, Gautam [2 ]
机构
[1] Calif State Polytech Univ Pomona, Comp Informat Syst Dept, Pomona, CA 91768 USA
[2] Univ Utah, Dept Operat & Informat Syst, Salt Lake City, UT 84112 USA
[3] Univ Utah, David Eccles Sch Business, Salt Lake City, UT 84112 USA
基金
美国国家科学基金会;
关键词
Web mining; Revenue comparison; Social network analysis; Business news; Intercompany network; INFORMATION; WEB;
D O I
10.1016/j.dss.2009.04.007
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Large volumes of online business news provide an opportunity to explore various aspects of companies. A news story pertaining to a company often cites other companies. Using such company citations we construct an intercompany network. employ social network analysis techniques to identify a set of attributes from the network structure, and feed the attributes to machine learning methods to predict the company revenue relation (CRR) that is based on two companies' relative quantitative financial data. Hence, we seek to understand the power of network structural attributes in predicting CRRs that are not described in the news or known at the time the news was published. The network attributes produce close to 80% precision, recall, and accuracy for all 87,340 company pairs in the network. This approach is scalable and can be extended to private and foreign companies for which financial data is unavailable or hard to procure. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:408 / 414
页数:7
相关论文
共 35 条
[1]  
[Anonymous], Data Mining Practical Machine Learning Tools and Techniques with Java
[2]  
[Anonymous], 2006, MULTIVARIATE DATA AN
[3]  
[Anonymous], 1993, C4.5: Programs for machine learning
[4]  
[Anonymous], 2002, Zipf, power-laws, and pareto-a ranking tutorial
[5]   Predicting earnings using a model based on cost variability and cost stickiness [J].
Banker, RD ;
Chen, L .
ACCOUNTING REVIEW, 2006, 81 (02) :285-307
[6]   Scale-free characteristics of random networks:: the topology of the World-Wide Web [J].
Barabási, AL ;
Albert, R ;
Jeong, H .
PHYSICA A, 2000, 281 (1-4) :69-77
[7]  
BERNSTEIN A, 2002, P KDD 2002 WORKSH MU
[8]   A faster algorithm for betweenness centrality [J].
Brandes, U .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177
[10]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117