Identifying Emotions in Social Media: Comparison of Word-emotion lexica

In recent years, emotions expressed in social media messages have become a vivid research topic due to their influence on the spread of misinformation and online radicalization over online social networks. Thus, it is important to correctly identify emotions in order to make inferences from social media messages. In this paper, we report on the performance of three publicly available word-emotion lexicons (NRC, DepecheMood, EmoSenticNet) over a set of Facebook and Twitter messages. To this end, we designed and implemented an algorithm that applies natural language processing (NLP) techniques along with a number of heuristics that reflect the way humans naturally assess emotions in written texts. In order to evaluate the appropriateness of the obtained emotion scores, we conducted a questionnaire-based survey with human raters. Our results show that there are noticeable differences between the performance of the lexicons as well as with respect to emotion scores the human raters provided in our surve

Flow-Aware Elephant Flow Detection for Software-Defined Networks

Software-defined networking (SDN) separates the network control plane from the packet forwarding plane, which provides comprehensive network-state visibility for better network management and resilience. Traffic classification, particularly for elephant flow detection, can lead to improved flow control and resource provisioning in SDN networks. Existing elephant flow detection techniques use pre-set thresholds that cannot scale with the changes in the traffic concept and distribution. This paper proposes a flow-aware elephant flow detection applied to SDN. The proposed technique employs two classifiers, each respectively on SDN switches and controller, to achieve accurate elephant flow detection efficiently. Moreover, this technique allows sharing the elephant flow classification tasks between the controller and switches. Hence, most mice flows can be filtered in the switches, thus avoiding the need to send large numbers of classification requests and signaling messages to the controller. Experimental findings reveal that the proposed technique outperforms contemporary methods in terms of the running time, accuracy, F-measure, and recall

Identifying collaborations among researchers: a pattern-based approach

In recent years a huge amount of publications and scientific reports has become available through digital libraries and online databases. Digital libraries commonly provide advanced search interfaces, through which researchers can find and explore the most related scientific studies. Even though the publications of a single author can be easily retrieved and explored, understanding how authors have collaborated with each other on specific research topics and to what extent their collaboration have been fruitful is, in general, a challenging task. This paper proposes a new pattern-based approach to analyzing the correlations among the authors of most influential research studies. To this purpose, it analyzes publication data retrieved from digital libraries and online databases by means of an itemset-based data mining algorithm. It automatically extracts patterns representing the most relevant collaborations among authors on specific research topics. Patterns are evaluated and ranked according to the number of citations received by the corresponding publications. The proposed approach was validated in a real case study, i.e., the analysis of scientific literature on genomics. Specifically, we first analyzed scientific studies on genomics acquired from the OMIM database to discover correlations between authors and genes or genetic disorders. Then, the reliability of the discovered patterns was assessed using the PubMed search engine. The results show that, for the majority of the mined patterns, the most influential (top ranked) studies retrieved by performing author-driven PubMed queries range over the same gene/genetic disorder indicated by the top ranked pattern

A New Extraction Optimization Approach to Frequent 2 Item sets

International Journal on Computational Science Applications (IJCSA) ISSN : 2200 – 0011 https://wireilla.com/ijcsa/index.html Current Issue Article Title: A New Extraction Optimization Approach to Frequent 2 Item sets Abstract In this paper, we propose a new optimization approach to the APRIORI reference algorithm (AGR 94) for 2-itemsets (sets of cardinal 2). The approach used is based on two-item sets. We start by calculating the 1- itemets supports (cardinal 1 sets), then we prune the 1-itemsets not frequent and keep only those that are frequent (ie those with the item sets whose values are greater than or equal to a fixed minimum threshold). During the second iteration, we sort the frequent 1-itemsets in descending order of their respective supports and then we form the 2-itemsets. In this way the rules of association are discovered more quickly. Experimentally, the comparison of our algorithm OPTI2I with APRIORI, PASCAL, CLOSE and MAXMINER, shows its efficiency on weakly correlated data. Our work has also led to a classical model of sideby-side classification of items that we have obtained by establishing a relationship between the different sets of 2-itemsets. Keywords Optimization, Frequent Itemsets, Association Rules, Low-Correlation Data, Supports For More Details: https://wireilla.com/papers/ijcsa/V9N2/9219ijcsa01.pd