Evolving Gaussian on-line clustering in social network analysis

被引:5
|
作者
Skrjanc, Igor [1 ]
Andonovski, Goran [1 ]
Iglesias, Jose Antonio [2 ]
Sesmero, Maria Paz [2 ]
Sanchis, Araceli [2 ]
机构
[1] Univ Ljubljana, Fac Elect Engn, Ljubljana, Slovenia
[2] Univ Carlos III Madrid, Dept Comp Sci & Engn, Madrid, Spain
关键词
Evolvingclustering; Twitterdataanalysis; Onlinemethod; Gaussianprobability; EVENT DETECTION; FUZZY; TWITTER; MODEL; IDENTIFICATION; CLASSIFICATION; CONTROLLER;
D O I
10.1016/j.eswa.2022.117881
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we present an evolving data-based approach to automatically cluster Twitter users according to their behavior. The clustering method is based on the Gaussian probability density distribution combined with a Takagi-Sugeno fuzzy consequent part of order zero (eGauss0). This means that this method can be used as a classifier that is actually a mapping from the feature space to the class label space. The eGauss method is very flexible, is computed recursively, and the most important thing is that it starts learning "from scratch". The structure adapts to the new data using adding and merging mechanisms. The most important feature of the evolving method is that it can process data from thousands of Twitter profiles in real time, which can be characterized as a Big Data problem. The final clusters yield classes of Twitter profiles, which are represented as different activity levels of each profile. In this way, we could classify each member as ordinary, very active, influential and unusual user. The proposed method was also tested on the Iris and Breast Cancer Wisconsin datasets and compared with other methods. In both cases, the proposed method achieves high classification rates and shows competitive results.
引用
收藏
页数:8
相关论文
共 50 条
  • [41] Clustering, Prominence and Social Network Analysis on Incomplete Networks
    Hegde, Kshiteesh
    Magdon-Ismail, Malik
    Szymanski, Boleslaw
    Kuzmin, Konstantin
    [J]. COMPLEX NETWORKS & THEIR APPLICATIONS V, 2017, 693 : 287 - 298
  • [42] Properties of on-line social systems
    Grabowski, A.
    Kruszewska, N.
    Kosinski, R. A.
    [J]. EUROPEAN PHYSICAL JOURNAL B, 2008, 66 (01): : 107 - 113
  • [43] Properties of on-line social systems
    A. Grabowski
    N. Kruszewska
    R. A. Kosiński
    [J]. The European Physical Journal B, 2008, 66 : 107 - 113
  • [44] Improved BSP Clustering Algorithm for Social Network Analysis
    Sharma, Sanjiv
    Gupta, R. K.
    [J]. INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING, 2010, 3 (03): : 67 - 76
  • [45] Augmenting Rapid Clustering Method for Social Network Analysis
    Prabhu, J.
    Sudharshan, M.
    Saravanan, M.
    Prasad, G.
    [J]. 2010 INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2010), 2010, : 407 - 408
  • [46] ISTRIA: An on-line neural network system for the analysis of financial markets
    DiPasquale, S
    Maifredi, G
    Temporin, M
    [J]. NEURAL NETWORKS AND THEIR APPLICATIONS, 1996, : 133 - 142
  • [47] Particle characterization with on-line imaging and neural network image analysis
    Wu, Yuanyi
    Lin, Mengxing
    Rohani, Sohrab
    [J]. CHEMICAL ENGINEERING RESEARCH & DESIGN, 2020, 157 : 114 - 125
  • [48] On-Line Valuation of Residential Premises with Evolving Fuzzy Models
    Lughofer, Edwin
    Trawinski, Bogdan
    Trawinski, Krzysztof
    Lasota, Tadeusz
    [J]. HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, PART I, 2011, 6678 : 107 - +
  • [49] OLGAVis: On-Line Graph Analysis and Visualization for Bibliographic Information Network
    Jo, Sunhwa
    Park, Beomjun
    Lee, Suan
    Kim, Jinho
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (09):
  • [50] An on-line agglomerative clustering method for nonstationary data
    Guedalia, ID
    London, M
    Werman, M
    [J]. NEURAL COMPUTATION, 1999, 11 (02) : 521 - 540