Please use this identifier to cite or link to this item:
Title: A low dimensional approach on network characterization
Authors: Li, BYS
Zhan, C 
Yeung, LF
Ko, KT
Yang, G
Issue Date: 2014
Publisher: Public Library of Science
Source: PLoS one, 2014, v. 9, no. 10, e109383, p. 1-12 How to cite?
Journal: PLoS one 
Abstract: In many applications, one may need to characterize a given network among a large set of base networks, and these networks are large in size and diverse in structure over the search space. In addition, the characterization algorithms are required to have low volatility and with a small circle of uncertainty. For large datasets, these algorithms are computationally intensive and inefficient. However, under the context of network mining, a major concern of some applications is speed. Hence, we are motivated to develop a fast characterization algorithm, which can be used to quickly construct a graph space for analysis purpose. Our approach is to transform a network characterization measure, commonly formulated based on similarity matrices, into simple vector form signatures. We shall show that the N x N similarity matrix can be represented by a dyadic product of two N-dimensional signature vectors; thus the network alignment process, which is usually solved as an assignment problem, can be reduced into a simple alignment problem based on separate signature vectors.
EISSN: 1932-6203
DOI: 10.1371/journal.pone.0109383
Rights: © 2014 Li et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
The following publication Li, B. Y. S., Zhan, C., Yeung, L. F., Ko, K. T., & Yang, G. (2014). A low dimensional approach on network characterization. PLoS ONE, 9(10), e109383, 1-12 is available at
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Li_Low_Dimensional_Approach.pdf444.46 kBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Contents

Page view(s)

Citations as of Feb 19, 2019


Citations as of Feb 19, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.