Reference face graph for face recognition

Face recognition has been studied extensively; however, real-world face recognition still remains a challenging task. The demand for unconstrained practical face recognition is rising with the explosion of online multimedia such as social networks, and video surveillance footage where face analysis is of significant importance. In this paper, we approach face recognition in the context of graph theory. We recognize an unknown face using an external reference face graph (RFG). An RFG is generated and recognition of a given face is achieved by comparing it to the faces in the constructed RFG. Centrality measures are utilized to identify distinctive faces in the reference face graph. The proposed RFG-based face recognition algorithm is robust to the changes in pose and it is also alignment free. The RFG recognition is used in conjunction with DCT locality sensitive hashing for efficient retrieval to ensure scalability. Experiments are conducted on several publicly available databases and the results show that the proposed approach outperforms the state-of-the-art methods without any preprocessing necessities such as face alignment. Due to the richness in the reference set construction, the proposed method can also handle illumination and expression variation

A Comprehensive Bibliometric Analysis on Social Network Anonymization: Current Approaches and Future Directions

In recent decades, social network anonymization has become a crucial research field due to its pivotal role in preserving users' privacy. However, the high diversity of approaches introduced in relevant studies poses a challenge to gaining a profound understanding of the field. In response to this, the current study presents an exhaustive and well-structured bibliometric analysis of the social network anonymization field. To begin our research, related studies from the period of 2007-2022 were collected from the Scopus Database then pre-processed. Following this, the VOSviewer was used to visualize the network of authors' keywords. Subsequently, extensive statistical and network analyses were performed to identify the most prominent keywords and trending topics. Additionally, the application of co-word analysis through SciMAT and the Alluvial diagram allowed us to explore the themes of social network anonymization and scrutinize their evolution over time. These analyses culminated in an innovative taxonomy of the existing approaches and anticipation of potential trends in this domain. To the best of our knowledge, this is the first bibliometric analysis in the social network anonymization field, which offers a deeper understanding of the current state and an insightful roadmap for future research in this domain.Comment: 73 pages, 28 figure

Ranking Influential Nodes of Fake News Spreading on Mobile Social Networks

Online fake news can generate a negative impact on both users and society. Due to the concerns with spread of fake news and misinformation, assessing the network influence of online users has become an important issue. This study quantifies the influence of nodes by proposing an algorithm based on information entropy theory. Dynamic process of influence of nodes is characterized on mobile social networks (MSNs). Weibo (i.e., the Chinese version of microblogging) users are chosen to build the real network and quantified influence of them is analyzed according to the model proposed in this paper. MATLAB is employed to simulate and validate the model. Results show the comprehensive influence of nodes increases with the rise of two factors: the number of nodes connected to them and the frequency of their interaction. Indirect influence of nodes becomes stronger than direct influence when the network scope rises. This study can help relevant organizations effectively oversee the spread of online fake news on MSNs

White Space Network Management: Spectrum Quanti cation, Spectrum Allocation and Network Design

Philosophiae Doctor - PhD (Computer Science)The unused spectrum in the television broadcasting frequency bands (so-called TV white spaces) can alleviate the spectrum crunch, and have potential to provide broadband connection to rural areas of countries in the developing world. Current research on TV white spaces focuses on how to detect them accurately, and how they can be shared or allocated to secondary devices. Therefore, the focus of this research is three-fold: to investigate a novel distributed framework, which does not use propagation models in detecting TV white spaces, and suitable for use in countries of the developing world; to investigate a suitable spectrum sharing mechanism for short-time leasing of the TV white spaces to secondary devices; and extend the research to investigate the design of a TV white space-ware network in TV white space frequencies

Learning Hidden Influences in Large-Scale Dynamical Social Networks: A Data-Driven Sparsity-Based Approach, in Memory of Roberto Tempo

The processes of information diffusion across social networks (for example, the spread of opinions and the formation of beliefs) are attracting substantial interest in disciplines ranging from behavioral sciences to mathematics and engineering (see "Summary"). Since the opinions and behaviors of each individual are infl uenced by interactions with others, understanding the structure of interpersonal infl uences is a key ingredient to predict, analyze, and, possibly, control information and decisions [1]. With the rapid proliferation of social media platforms that provide instant messaging, blogging, and other networking services (see "Online Social Networks") people can easily share news, opinions, and preferences. Information can reach a broad audience much faster than before, and opinion mining and sentiment analysis are becoming key challenges in modern society [2]. The first anecdotal evidence of this fact is probably the use that the Obama campaign made of social networks during the 2008 U.S. presidential election [3]. More recently, several news outlets stated that Facebook users played a major role in spreading fake news that might have infl uenced the outcome of the 2016 U.S. presidential election [4]. This can be explained by the phenomena of homophily and biased assimilation [5]-[7] in social networks, which correspond to the tendency of people to follow the behaviors of their friends and establish relationships with like-minded individuals

Structure-oriented prediction in complex networks

Complex systems are extremely hard to predict due to its highly nonlinear interactions and rich emergent properties. Thanks to the rapid development of network science, our understanding of the structure of real complex systems and the dynamics on them has been remarkably deepened, which meanwhile largely stimulates the growth of effective prediction approaches on these systems. In this article, we aim to review different network-related prediction problems, summarize and classify relevant prediction methods, analyze their advantages and disadvantages, and point out the forefront as well as critical challenges of the field