39 research outputs found
Not Every Couple Is a Pair: A Supervised Approach for Lifetime Collaborator Identification
While scientific collaboration can be critical for a scholar, some collaborator(s) can be more significant than others, a.k.a. lifetime collaborator(s). This work-in-progress aims to investigate whether it is possible to predict/identify lifetime collaborators given a junior scholar\u27s early profile. For this purpose, we propose a supervised approach by leveraging scholars\u27 local and network properties. Extensive experiments on DBLP digital library demonstrate that lifetime collaborators can be accurately predicted. The proposed model outperforms baseline models with various predictors. Our study may shed light on the exploration of scientific collaborations from the perspective of life-long collaboration
The evolution of Turing Award Collaboration Network : bibliometric-level and network-level metrics
The year of 2017 for the 50th anniversary of the Turing Award, which represents the top-level award in the computer science field, is a milestone. We study the long-term evolution of the Turing Award Collaboration Network, and it can be considered as a microcosm of the computer science field from 1974 to 2016. First, scholars tend to publish articles by themselves at the early stages, and they began to focus on tight collaboration since the late 1980s. Second, compared with the same scale random network, although the Turing Award Collaboration Network has small-world properties, it is not a scale-free network. The reason may be that the number of collaborators per scholar is limited. It is impossible for scholars to connect to others freely (preferential attachment) as the scale-free network. Third, to measure how far a scholar is from the Turing Award, we propose a metric called the Turing Number (TN) and find that the TN decreases gradually over time. Meanwhile, we discover the phenomenon that scholars prefer to gather into groups to do research with the development of computer science. This article presents a new way to explore the evolution of academic collaboration network in the field of computer science by building and analyzing the Turing Award Collaboration Network for decades. © 2014 IEEE
Random Walks: A Review of Algorithms and Applications
A random walk is known as a random process which describes a path including a
succession of random steps in the mathematical space. It has increasingly been
popular in various disciplines such as mathematics and computer science.
Furthermore, in quantum mechanics, quantum walks can be regarded as quantum
analogues of classical random walks. Classical random walks and quantum walks
can be used to calculate the proximity between nodes and extract the topology
in the network. Various random walk related models can be applied in different
fields, which is of great significance to downstream tasks such as link
prediction, recommendation, computer vision, semi-supervised learning, and
network embedding. In this paper, we aim to provide a comprehensive review of
classical random walks and quantum walks. We first review the knowledge of
classical random walks and quantum walks, including basic concepts and some
typical algorithms. We also compare the algorithms based on quantum walks and
classical random walks from the perspective of time complexity. Then we
introduce their applications in the field of computer science. Finally we
discuss the open issues from the perspectives of efficiency, main-memory
volume, and computing time of existing algorithms. This study aims to
contribute to this growing area of research by exploring random walks and
quantum walks together.Comment: 13 pages, 4 figure
Emerging Trends, Issues, and Challenges in Big Data and Its Implementation toward Future Smart Cities
(c) 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other worksHan, G.; Guizani, M.; Lloret, J.; Chan, S.; Wan, L.; Guibene, W. (2017). Emerging Trends, Issues, and Challenges in Big Data and Its Implementation toward Future Smart Cities. IEEE Communications Magazine. 55(12):16-17. https://doi.org/10.1109/MCOM.2017.8198795S1617551
Deep matrix factorization for trust-aware recommendation in social networks
Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE
A Novel Method Based on Oblique Projection Technology for Mixed Sources Estimation
Reducing the computational complexity of the near-field sources and far-field sources localization algorithms has been considered as a serious problem in the field of array signal processing. A novel algorithm caring for mixed sources location estimation based on oblique projection is proposed in this paper. The sources are estimated at two different stages and the sensor noise power is estimated and eliminated from the covariance which improve the accuracy of the estimation of mixed sources. Using the idea of compress, the range information of near-field sources is obtained by searching the partial area instead of the whole Fresnel area which can reduce the processing time. Compared with the traditional algorithms, the proposed algorithm has the lower computation complexity and has the ability to solve the two closed-spaced sources with high resolution and accuracy. The duplication of range estimation is also avoided. Finally, simulation results are provided to demonstrate the performance of the proposed method