Data-driven tree structure for PIN models

Emily Lin,Chu-Lan Michael Kao, Natasha Sonia Adityarini

REVIEW OF QUANTITATIVE FINANCE AND ACCOUNTING(2021)

引用 1|浏览4
暂无评分
摘要
Probability of informed trading (PIN) models characterize trading with certain types of information through a tree structure. Different tree structures with different numbers of groups for market participants have been proposed, with no clear, consistent tree used in the literature. One of the main causes of this inconsistency is that these trees are artificially proposed through a bottom-up approach rather than implied by actual market data. Therefore, in this paper, we propose a method that infers a tree structure directly from empirical data. More precisely, we use hierarchical clustering to construct a tree for each individual firm and then infer an aggregate tree through a voting mechanism. We test this method on US data from January 2002 for 7608 companies, which results in a tree with two layers and four groups. The characteristics of the resulting aggregate tree are between those of several proposed tree structures in the literature, demonstrating that these proposed trees all reflect only part of the market, and one should consider the proposed empirically driven method when seeking a tree representing the whole market.
更多
查看译文
关键词
PIN model, Hierarchical clustering, Tree voting, Data-driven method
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要