Influential Researcher Identification in Academic Network Using Rough Set Based Selection of Time-Weighted Academic and Social Network Features

Author(s):  
Manju G. ◽  
Kavitha V. ◽  
Geetha T.V.

Researchers entering into a new research area are interested in knowing the current research trends, popular publications and influential (popular) researchers in that area in order to initiate their research. In this work, we attempt to determine the influential researcher for a specific topic. The active participation of the researchers in both the academic and social network activities signifies the researchers' influence level across time. The content and frequency of social interaction to a researcher reflects his or her influence. In our system, appropriate time-based social and academic features are selected using entropy based feature selection approach of rough set theory. A three layer model comprising semantically related concepts, researcher and social relations is developed based on the appropriate (influential) features. The researchers' topic trajectories are identified and recommended using Spreading activation algorithm. To cope up with the scalable academic network, map reduce paradigm has been employed in the spreading activation algorithm.

2020 ◽  
pp. 378-406
Author(s):  
Manju G. ◽  
Kavitha V. ◽  
Geetha T.V.

Researchers entering into a new research area are interested in knowing the current research trends, popular publications and influential (popular) researchers in that area in order to initiate their research. In this work, we attempt to determine the influential researcher for a specific topic. The active participation of the researchers in both the academic and social network activities signifies the researchers' influence level across time. The content and frequency of social interaction to a researcher reflects his or her influence. In our system, appropriate time-based social and academic features are selected using entropy based feature selection approach of rough set theory. A three layer model comprising semantically related concepts, researcher and social relations is developed based on the appropriate (influential) features. The researchers' topic trajectories are identified and recommended using Spreading activation algorithm. To cope up with the scalable academic network, map reduce paradigm has been employed in the spreading activation algorithm.


2011 ◽  
pp. 239-268 ◽  
Author(s):  
Krzysztof Pancerz ◽  
Zbigniew Suraj

This chapter constitutes the continuation of a new research trend binding rough set theory with concurrency theory. In general, this trend concerns the following problems: discovering concurrent system models from experimental data represented by information systems, dynamic information systems or specialized matrices, a use of rough set methods for extracting knowledge from data, a use of rules for describing system behaviors, and modeling and analyzing of concurrent systems by means of Petri nets on the basis of extracted rules. Some automatized methods of discovering concurrent system models from data tables are presented. Data tables are created on the basis of observations or specifications of process behaviors in the modeled systems. Proposed methods are based on rough set theory and colored Petri net theory.


Filomat ◽  
2018 ◽  
Vol 32 (5) ◽  
pp. 1917-1930 ◽  
Author(s):  
Lei Shi ◽  
Qiguo Duan ◽  
Juanjuan Zhang ◽  
Lei Xi ◽  
Hongbo Qiao ◽  
...  

Agricultural data classification attracts more and more attention in the research area of intelligent agriculture. As a kind of important machine learning methods, ensemble learning uses multiple base classifiers to deal with classification problems. The rough set theory is a powerful mathematical approach to process unclear and uncertain data. In this paper, a rough set based ensemble learning algorithm is proposed to classify the agricultural data effectively and efficiently. An experimental comparison of different algorithms is conducted on four agricultural datasets. The results of experiment indicate that the proposed algorithm improves performance obviously.


2010 ◽  
Vol 2 (4) ◽  
pp. 13-36 ◽  
Author(s):  
Rahma Bouaziz ◽  
Tiago Simas ◽  
Fátima Dargam ◽  
Rita Ribeiro ◽  
Pascale Zaraté

This paper addresses aspects of the social network analysis (SNA) performed on the social-academic network implemented for the EURO Working Group on Decision Support Systems (EWG-DSS). The EWG-DSS network has more than 105 members and is defined with the objective of analysing and representing the various relationships that academically link the group members, as well as evaluating the group’s collaboration dynamics. This paper shows graphical representations and discusses their corresponding interpretation and analytical data. This work is part of the study carried out within the underlying project of the EWG-DSS social-academic network to understanding how the group interacts, as well as encouraging new research and promoting further collaboration among the EWG-DSS group members.


Author(s):  
Rahma Bouaziz ◽  
Tiago Simas ◽  
Fátima Dargam ◽  
Rita Ribeiro ◽  
Pascale Zaraté

This paper addresses aspects of the social network analysis (SNA) performed on the social-academic network implemented for the EURO Working Group on Decision Support Systems (EWG-DSS). The EWG-DSS network has more than 105 members and is defined with the objective of analysing and representing the various relationships that academically link the group members, as well as evaluating the group’s collaboration dynamics. This paper shows graphical representations and discusses their corresponding interpretation and analytical data. This work is part of the study carried out within the underlying project of the EWG-DSS social-academic network to understanding how the group interacts, as well as encouraging new research and promoting further collaboration among the EWG-DSS group members.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Hengrong Ju ◽  
Huili Dou ◽  
Yong Qi ◽  
Hualong Yu ◽  
Dongjun Yu ◽  
...  

Decision-theoretic rough set is a quite useful rough set by introducing the decision cost into probabilistic approximations of the target. However, Yao’s decision-theoretic rough set is based on the classical indiscernibility relation; such a relation may be too strict in many applications. To solve this problem, aδ-cut decision-theoretic rough set is proposed, which is based on theδ-cut quantitative indiscernibility relation. Furthermore, with respect to criterions of decision-monotonicity and cost decreasing, two different algorithms are designed to compute reducts, respectively. The comparisons between these two algorithms show us the following: (1) with respect to the original data set, the reducts based on decision-monotonicity criterion can generate more rules supported by the lower approximation region and less rules supported by the boundary region, and it follows that the uncertainty which comes from boundary region can be decreased; (2) with respect to the reducts based on decision-monotonicity criterion, the reducts based on cost minimum criterion can obtain the lowest decision costs and the largest approximation qualities. This study suggests potential application areas and new research trends concerning rough set theory.


Author(s):  
František Dařena ◽  
Alexander Troussov ◽  
Jan Žižka

The social-network formation and analysis is nowadays one of objects that are in a focus of intensive research. The objective of the paper is to suggest the perspective of representing social networks as graphs, with the application of the graph theory to problems connected with studying the network-like structures and to study spreading activation algorithm for reasons of analyzing these structures. The paper presents the process of modeling multidimensional networks by means of directed graphs with several characteristics. The paper also demonstrates using Spreading Activation algorithm as a good method for analyzing multidimensional network with the main focus on recommender systems. The experiments showed that the choice of parameters of the algorithm is crucial, that some kind of constraint should be included and that the algorithm is able to provide a stable environment for simulations with networks.


There are several methods of Soft Computing for analyzing the complex data for making decisions and predictions. Rough Set Theory (RST) is one of the best and relatively new intelligent techniques used in different research area for making predictions. RST is used to discover the patterns of data, handle all the redundant objects and attributes. RST is majorly used for extraction the rules from the given data. In this paper, we will use a medical data set example of cancer for retrieving the rule which is useful to make prediction for the unknown class.


2019 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Yang Li ◽  
Xuhua Hu

Purpose The purpose of this paper is to solve the problem of information privacy and security of social users. Mobile internet and social network are more and more deeply integrated into people’s daily life, especially under the interaction of the fierce development momentum of the Internet of Things and diversified personalized services, more and more private information of social users is exposed to the network environment actively or unintentionally. In addition, a large amount of social network data not only brings more benefits to network application providers, but also provides motivation for malicious attackers. Therefore, under the social network environment, the research on the privacy protection of user information has great theoretical and practical significance. Design/methodology/approach In this study, based on the social network analysis, combined with the attribute reduction idea of rough set theory, the generalized reduction concept based on multi-level rough set from the perspectives of positive region, information entropy and knowledge granularity of rough set theory were proposed. Furthermore, it was traversed on the basis of the hierarchical compatible granularity space of the original information system and the corresponding attribute values are coarsened. The selected test data sets were tested, and the experimental results were analyzed. Findings The results showed that the algorithm can guarantee the anonymity requirement of data publishing and improve the effect of classification modeling on anonymous data in social network environment. Research limitations/implications In the test and verification of privacy protection algorithm and privacy protection scheme, the efficiency of algorithm and scheme needs to be tested on a larger data scale. However, the data in this study are not enough. In the following research, more data will be used for testing and verification. Practical implications In the context of social network, the hierarchical structure of data is introduced into rough set theory as domain knowledge by referring to human granulation cognitive mechanism, and rough set modeling for complex hierarchical data is studied for hierarchical data of decision table. The theoretical research results are applied to hierarchical decision rule mining and k-anonymous privacy protection data mining research, which enriches the connotation of rough set theory and has important theoretical and practical significance for further promoting the application of this theory. In addition, combined the theory of secure multi-party computing and the theory of attribute reduction in rough set, a privacy protection feature selection algorithm for multi-source decision table is proposed, which solves the privacy protection problem of feature selection in distributed environment. It provides a set of effective rough set feature selection method for privacy protection classification mining in distributed environment, which has practical application value for promoting the development of privacy protection data mining. Originality/value In this study, the proposed algorithm and scheme can effectively protect the privacy of social network data, ensure the availability of social network graph structure and realize the need of both protection and sharing of user attributes and relational data.


2019 ◽  
Vol 36 (5) ◽  
pp. 3993-4003 ◽  
Author(s):  
S. Priyanga ◽  
M.R. Gauthama Raman ◽  
Sujeet S. Jagtap ◽  
N. Aswin ◽  
Kannan Kirthivasan ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document