2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information
Login Paper Search My Schedule Paper Index Help

My ICASSP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDMLSP-9.4
Paper Title Online Multi-hop Information based Kernel Learning over Graphs
Authors Zixiao Zong, Yanning Shen, University of California, Irvine, United States
SessionMLSP-9: Learning Theory for Neural Networks
LocationGather.Town
Session Time:Tuesday, 08 June, 16:30 - 17:15
Presentation Time:Tuesday, 08 June, 16:30 - 17:15
Presentation Poster
Topic Machine Learning for Signal Processing: [MLR-LEAR] Learning theory and algorithms
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract With complex systems emerging in various applications, e.g., financial, biological and social networks, graphs become working horse to model and analyse these systems. Nodes within networks usually entail attributes. Due to privacy concerns and missing observations, nodal attributes may be unavailable for some nodes in real-world networks. Besides, new nodes with unknown nodal attributes may emerge at any time, which require evaluation of the corresponding attributes in real-time. In this context, the present paper reconstructs nodal attributes of unobserved ones via an estimated nodal function based on their connectivity patterns with other nodes in the graph. Unlike existing works which only consider single-hop neighbors, the present paper further explores global information and adaptively combines the effects of multi-hop neighbors together. A multikernel-based approach is developed, which is capable of leveraging global network information, and scales well with network size as well. In addition, it has the flexibility to account for different nonlinear relationship by adaptively selecting the appropriate kernel combination. Experiments on real-word datasets corroborate the merits of the proposed algorithm.