Search

The human mind is an amazing piece of creation that can handle multiple modalities of input seamlessly and help to make sense about the surroundings. When it comes to making sense about speech, 2 main features of input are sound and vision (although there are many other components). Since not every mind is alike, some of them have trouble processing the sound aspect of input therefore vision becomes their primary source to process and understand speech. Lip reading is a skill that is used mainly by people suffering from hearing deformities and it involves large amount of language specific knowledge as well as contextual awareness i.e. using all possible visual clues that help to make sense of what the other person is saying and thus allow them to take part in the conversation. Recent breakthroughs in the field of Deep learning have clearly shown promise with models that have the ability to extract complex, intricate and generalizable patterns both in spatial as well as temporal dimension. In this paper we present FYEO (For Your Eyes Only) an end-to-end deep learning based solution that only uses vision as its single modality of input and generates a single word, character by character. The model is a modified version of the LipNet architecture from Deep Mind, to a subset of words curated from the Oxford-BBC Lip Reading in the Wild (LRW) dataset. Also, as a part of novel work FYEO is extended by adding attention mechanism for further improvement of the model’s contextual awareness and observe the model’s focus while making a prediction. The standard FYEO model achieves a length normalised test CER (character-error-rate) of 25.024%.

Centrality in social network is one of the major research topics in social network analysis. Even though there are more than half a dozen methods to find centrality of a node, each of these methods has some drawbacks in one aspect or the other. This paper analyses different centrality calculation methods and proposes a new swarm based method named Flocking Based Centrality for Social network (FBCS). This new computation technique makes use of parameters that are more realistic and practical in online social networks. The interactions between nodes play a significant role in determining the centrality of node. The new method has been calculated both empirically as well as experimentally. The new method is tested, verified and validated for different sets of random networks and benchmark datasets. The method has been correlated with other state of the art centrality measures. The new centrality measure is found to be realistic and suits well with online social networks. The proposed method can be used in applications such as finding the most prestigious node and for discovering the node which can influence maximum number of users in an online social network. FBCS centrality has higher Kendall’s tau correlation when compared with other state of the art centrality methods. The robustness of the FBCS centrality is found to be better than other centrality measures.

Online Social networks have gained much prominence in the recent years such that it has become an unavoidable means of daily communication. The element of trust in social networks has been studied ever since the inception of online social networks. Trust in online social networks is extremely fragile in nature due to the virtual connections between users in the network. The level of trustworthiness of each user in a social network varies and is usually computed using reputation level of the users. This paper focuses on identifying the features that determine the trust of a user in online social networks using benchmark datasets. We propose a new probabilistic reputation feature model that is better than the raw reputation features. The enhanced trust prediction framework has been tested and validated on three benchmark datasets namely Wikipedia election dataset, Epinions dataset and Slashdot dataset. The proposed probabilistic feature enhances the overall accuracy, F1 score, and area under the ROC for the classifier results significantly. The results have been compared with other state of the art techniques and are found to be efficient.

There has been a surge in the research of complex network analysis in the recent years. This paper engages with online social network, which is the most popular complex network in the modern world. Network communities help to understand the organization of real world networks. Accordingly, this paper proposes and validates a novel algorithm for overlapping community detection in online social networks. We focus on the stability-plasticity problem in complex networks and attempt to solve it using a Fuzzy Adaptive resonance theory inspired algorithm. The algorithm consists of two stages namely prediction stage and comparison stage. The proposed algorithms make use of network measures such as Edge betweenness, Betweenness centrality, and pair betweenness. The algorithm has been tested and compared with other algorithms using benchmark datasets, artificial datasets and real network datasets. The experimental results obtained were better than other overlapping community detection algorithms. The entropy of the proposed model has been evaluated using Overlapping normalized information, omega index, F-score and the cumulative performance value is 2.42 out of 3, which is better than other community detection algorithm.

There has been lot of research endeavours in detecting overlapping community structures in complex networks. This paper concentrates on one of the most popular complex networks of recent times—online social networks. Some of the existing methodologies in community detection for online social networks are discussed. The goal of the proposed algorithm is to solve the stability–plasticity dilemma and to suggest a new technique for detecting modular and granular overlaps in community detection. The stability–plasticity dilemma is solved using a Fuzzy ART-inspired algorithm for overlapping community detection for detecting modular and granular overlaps. The algorithm is designed by making use of network measures such as vertex betweenness, betweenness centrality, and split betweenness. The validation metrics used for testing the algorithm were sensitivity, specificity, accuracy and normalized mutual information. The algorithm has been tested and validated using benchmark datasets and real network datasets and gives a cumulative performance of 3.1/4.0.

Online Social networks have become popular with the increased use of mobile devices. Online Social network analysis alleviates the quantitative as well as qualitative analysis of online social networks. Online social networks deals with human emotions and communications, the vagueness in the process is more and is a hindrance in computation. We analyze two network measures namely centrality and prestige by developing a fuzzy rule based inference system. We obtained the relation between interaction, centrality and prestige in online social networks. The paper describes in detail, the need for a fuzzy approach in online social network analysis and analyzes the network measures.

Online social networks have gained importance in the past few years and have become an inseparable form of communication. People use online social networks for making friends, gaining knowledge, for entertainment and to review products. This increased influence of social networks has led to the emergence of a research area named online social network analysis. In this paper we propose a model fuzzy inference system that analyze and quantify the network measures used in the analysis of online social networks. We have divided the network measures into two classes namely connection based measures and network structure based measure. We have linked the connection based measures with the network structure based measure and have produced a fuzzy inference system for online social network analysis.