1 code implementation • 21 Jan 2018 • Liang Ding, Di Chang, Russell Malmberg, Aaron Martinez, David Robinson, Matthew Wicker, Hongfei Yan, Liming Cai
The seminal work of Chow and Liu (1968) shows that approximation of a finite probabilistic system by Markov trees can achieve the minimum information loss with the topology of a maximum spanning tree.
no code implementations • 19 Jul 2017 • Zeya Zhang, Weizheng Chen, Hongfei Yan
After that, we construct the features of news based on the positive polar of their words.
1 code implementation • 6 Feb 2015 • Wayne Xin Zhao, Xu-Dong Zhang, Daniel Lemire, Dongdong Shan, Jian-Yun Nie, Hongfei Yan, Ji-Rong Wen
Compression algorithms are important for data oriented tasks, especially in the era of Big Data.