Prof. C. Chan

Institute of Network Coding
The Chinese University of Hong Kong

Biography

Chung Chan received the B.Sc., M.Eng. and Ph.D. from the EECS Department at MIT in 2004, 2005 and 2010 respectively. He is currently a Research Assistant Professor at the Institute of Network Coding, the Chinese University of Hong Kong.

His research is in the area of information theory, with applications to network coding, multiple-terminal source coding and security problems that involve high-dimensional statistics. He is currently working on machine learning applications such as data clustering and feature selection.

Research interest

My current research focuses on an inter-disciplinary study of high dimensional statistics. The goal is to bring engineering insights from information theory to practical problems in machine learning. We have developed a dependency model using matroids and linking systems, and shown that the model is applicable to seemingly different problems in network coding, security and combinatorics. In particular, we have established a meaningful measure of multivariate mutual information that extends Shannon’s mutual information to the multivariate case. Some important properties of the measure have been found and shown to be applicable to the problem of data clustering in machine learning, such as gene clustering and human connectome.

Teaching

Publications

Journal papers

  • C. Chan, A. Al-Bashabsheh, Q. Zhou, T. Kaced and T. Liu, “Info-Clustering: A Mathematical Theory of Data Clustering,” in IEEE Transactions on Molecular, Biological and Multi-Scale Communications, vol. 2, no. 1, pp. 64-91, June 2016. Presented at Shannon Centenary Workshop in Hong Kong and Claude Shannon's Centennial Day in Shanghai in 2016.

    manuscript, arXiv, audio slides, video, recording at Shannon Centenary Workshop in Hong Kong

  • C. Chan, A. Al-Bashabsheh, Q. Zhou, N. Ding, T. Liu, and A. Sprintson, “Successive omniscience,” accepted by IEEE Transactions on Information Theory, Mar 2016.

    DOI: 10.1109/TIT.2016.2555923

  • C. Chan, A. Al-Bashabsheh, J. Ebrahimi, T. Kaced, and T. Liu, “Multivariate mutual information inspired by secret-key agreement,” Proceedings of the IEEE, vol. 103, no. 10, pp. 1883– 1913, 2015, issn: 0018-9219.

    DOI: 10.1109/JPROC.2015.2458316

  • C. Chan and L. Zheng, “Multiterminal secret key agreement,” Information Theory, IEEE Transactions on, vol. 60, no. 6, pp. 3379–3412, 2014, issn: 0018-9448.

    10.1109/TIT.2014.2313566

  • Q. T. Sun, S.-Y. R. Li, and C. Chan, “Matroidal characterization of optimal linear network codes over cyclic networks,” Communications Letters, IEEE, vol. 17, no. 10, pp. 1992–1995, 2013, issn: 1089-7798.

    10.1109/LCOMM.2013.13.131558

Submitted journal papers

  • C. Chan, A. Al-Bashabsheh, Q. Zhou, “Change of multivariate mutual information: from local to global,” submitted to IEEE Transactions on Information Theory on Dec 30, 2016.

    manuscript

  • C. Chan, A. Al-Bashabsheh, Q. Zhou and T. Liu, “Duality between feature selection and info-clustering,” submitted to IEEE Transactions on Information Theory on Oct 5th, 2016.

    manuscript

In preparation

  • C. Chan, A. Al-Bashabsheh and Q. Zhou, “Agglomerative info-clustering.”

    manuscript

  • C. Chan, M. Mukherjee, N. Kashyap and Q. Zhou, “Secret key agreement under discussion rate constraints.”

    manuscript

  • C. Chan, A. Al-Bashabsheh and Q. Zhou, “Info-clustering algorithms.”

  • C. Chan, M. Mukherjee, N. Kashyap and Q. Zhou, “Optimality of omniscience for secret key agreement.”

  • C. Chan, K. W. Shum and Q. T. Sun, “Matroidal network link model”.

Conferences

  • C. Chan, A. Al-Bashabsheh, Q. Zhou and T. Liu, “Duality between Feature Selection and Data Clustering,” in 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton Retreat Center, Monticello, Illinois, 2016.

    manuscript

  • C. Chan, M. Mukherjee, N. Kashyap and Q. Zhou, “When is omniscience a rate-optimal strategy for achieving secret key capacity?,” 2016 IEEE Information Theory Workshop (ITW), Cambridge, 2016, pp. 354-358.

    DOI: 10.1109/ITW.2016.7606855

  • C. Chan, M. Mukherjee, N. Kashyap, Q. Zhou, “When is Omniscience a Rate-Optimal Strategy for Achieving Secret Key Capacity,” submitted to IEEE Information Theory Workshop, 2016.

    manuscript

  • C. Chan, A. Al-Bashabsheh, Q. Zhou, “Incremental and decremental secret key agreement,” IEEE International Symposium on Information Theory, Barcelona, 2016, pp. 2514-2518.

    manuscript

  • C. Chan, “Clustering by Network Information Flow,” presented at DIMACS Workshop on Network Coding: The Next 15 Years, 2015.

    Audio slides: 1-minute lightning speech, 10-minute presentation, poster

  • C. Chan and T. Liu, “Clustering of random variables by multivariate mutual information on Chow-Liu tree approximations,” in Fifty-Third Annual Allerton Conference on Communication, Control, and Computing, Allerton Retreat Center, Monticello, Illinois, Sep. 2015.

    DOI: 10.1109/ALLERTON.2015.7447116

  • C. Chan, A. Al-Bashabsheh, J. B. Ebrahimi, T. Kaced, S. Kadhe, T. Liu, A. Sprintson, M. Yan, and Q. Zhou, “Successive omniscience,” in 2015 International Symposium on Network Coding (NetCod), Sydney, Australia, Jun. 2015.

    DOI: 10.1109/NETCOD.2015.7176782, video