Search

Abstract The field of social network analysis has identified User Alignment (UA) as a crucial area of investigation. The objective of UA is to identify and connect user accounts across diverse social networks, even when there are no explicit interconnections. UA plays a pivotal role in synthesising coherent user profiles and delving into the intricacies of user behaviour across platforms. However, traditional approaches have encountered limitations. Singular embedding techniques have been found to fall short in fully capturing the semantic essence of user profile attributes. Furthermore, classification-based embedding methods lack definitive criteria for categorisation, thereby constraining both the efficacy and applicability of these models. This paper presents a novel unsupervised Gradient Semantic Model for User Alignment (GSMUA) for the purpose of identifying common user identities across social networks. GSMUA categorises user profile information into weak, sub, and strong gradients based on the semantic intensity of attributes. Different gradient semantic levels direct attention to literal features, semantic features, or a combination of both during feature extraction, thereby achieving a full semantic representation of user attributes. In the case of strongly semantic long texts, GSMUA employs Named Entity Recognition (ENR) technology in order to enhance the inefficient handling of such texts. Furthermore, GSMUA compensates for missing user profile attributes by utilising profile information from user neighbours, thereby reducing the negative impact of missing user profile attributes on model performance. Extensive experiments conducted on four pairs of real datasets demonstrate the superiority of our approach. In comparison to the most effective previously developed unsupervised methods, GSMUA demonstrates improvements in hit-precision ranging from 5.32 to 12.17%. When compared to supervised methods, the improvements range from 0.71 to 11.79%.

Abstract Three‐way concept analysis is an important tool for information processing, and rule acquisition is one of the research hotspots of three‐way concept analysis. However, compared with three‐way concept lattices, three‐way semi‐concept lattices have three‐way operators with weaker constraints, which can generate more concepts. In this article, the problem of rule acquisition for three‐way semi‐concept lattices is discussed in general. The authors construct the finer relation of three‐way semi‐concept lattices, and propose a method of rule acquisition for three‐way semi‐concept lattices. The authors also discuss the set of decision rules and the relationships of decision rules among object‐induced three‐way semi‐concept lattices, object‐induced three‐way concept lattices, classical concept lattices and semi‐concept lattices. Finally, examples are provided to illustrate the validity of our conclusions.

Abstract Conflict is ubiquitous in human society and has a profound impact on various fields such as the economy, politics, law, and military. Many scholars have focused on exploring the internal mechanisms and potential solutions to conflicts. Notably, describing agents’ attitudes is an effective way to construct a conflict model. However, in decision-making, agents’ attitudes on issues are often vague and ambiguous. Pythagorean fuzzy set can deal with fuzzy information more accurately than intuitionistic fuzzy set. On the basis of this understanding, we investigate the conflicts from the perspective of Pythagorean fuzzy set. Firstly, we use Pythagorean fuzzy numbers to express the attitudes of agents on issues, and subsequently establish a Pythagorean fuzzy conflict information system. Secondly, we classify agents into three categories by a pair of thresholds to establish a trisected agent set model with risk preference. Thirdly, we construct a three-way conflict analysis model based on multi-granulation Pythagorean fuzzy decision-theoretic rough set and discuss both global and local conflicts by combining conflict analysis with multi-granulation decision-theoretic rough set. Finally, we discuss the relationships and properties of the proposed conflict analysis models.

Abstract Visible‐infrared person re‐identification (VI‐ReID) is a supplementary task of single‐modality re‐identification, which makes up for the defect of conventional re‐identification under insufficient illumination. It is more challenging than single‐modality ReID because, in addition to difficulties in pedestrian posture, camera shooting angle and background change, there are also difficulties in the cross‐modality gap. Existing works only involve coarse‐grained global features in the re‐ranking calculation, which cannot effectively use fine‐grained features. However, fine‐grained features are particularly important due to the lack of information in cross‐modality re‐ID. To this end, the Q‐center Multi‐granularity K‐reciprocal Re‐ranking Algorithm (termed QCMR) is proposed, including a Q‐nearest neighbour centre encoder (termed QNC) and a Multi‐granularity K‐reciprocal Encoder (termed MGK) for a more comprehensive feature representation. QNC converts the probe‐corresponding modality features into gallery corresponding modality features through modality transfer to narrow the modality gap. MGK takes a coarse‐grained mutual nearest neighbour as the dominant and combines a fine‐grained nearest neighbour as a supplement for similarity measurement. Extensive experiments on two widely used VI‐ReID benchmarks, SYSU‐MM01 and RegDB have shown that our method achieves state‐of‐the‐art results. Especially, the mAP of SYSU‐MM01 is increased by 5.9% in all‐search mode.

Abstract The tolerance rough set is developed as one of the outstanding extensions of the Pawlak's rough set model under incomplete information, and the limited tolerance relation is developed to overcome the problem that objects leniently satisfy the tolerance relation. However, the classification based on the limited tolerance relationship cannot reflect the matching degree of uncertain information of objects. In this article, we explore the influence of null values in an incomplete system, and propose the constrained tolerance relation based on the matching degree of uncertain information of objects. The proposed rough set based on the constrained tolerance relation can provide a more detailed structure of an object class through threshold. Proofs and example analyses further show the rationality and superiority of the proposed model.

Machine reading comprehension is a very challenging task, which aims to determine the answer span based on the given context and question. The newly developed pre-training language model has achieved a series of successes in various natural language understanding tasks with its powerful contextual representation ability. However, these pre-training language models generally lack the downstream processing structure for specific tasks, which limits further performance improvement. In order to solve this problem and deepen the model’s understanding of the question and context, this paper proposes S&I Reader. On the basis of the pre-training model, skimming, intensive reading, and gated mechanism modules are added to simulate the behavior of humans reading text and filtering information. Based on the idea of granular computing, a multi-granularity module for computing context granularity and sequence granularity is added to the model to simulate the behavior of human beings to understand the text from words to sentences, from parts to the whole. Compared with the previous machine reading comprehension model, our model structure is novel. The skimming module and multi-granularity module proposed in this paper are used to solve the problem that the previous model ignores the key information of the text and cannot understand the text with multi granularity. Experiments show that the model proposed in this paper is effective for both Chinese and English datasets. It can better understand the question and context and give a more accurate answer. The performance has made new progress on the basis of the baseline model.

Multi-label classification deals with the determination of instance-label associations for unseen instances. Although many margin-based approaches are delicately developed, the uncertainty classifications for those with smaller separation margins remain unsolved. The intuitionistic fuzzy set is an effective tool to characterize the concept of uncertainty, yet it has not been examined for multi-label cases. This paper proposed a novel model called intuitionistic fuzzy three-way label enhancement (IFTWLE) for multi-label classification. The IFTWLE combines label enhancement with an intuitionistic fuzzy set under the framework of three-way decisions. For unseen instances, we generated the pseudo-label for label uncertainty evaluation from a logical label-based model. An intuitionistic fuzzy set-based instance selection principle seamlessly bridges logical label learning and numerical label learning. The principle is hierarchically developed. At the label level, membership and non-membership functions are pair-wisely defined to measure the local uncertainty and generate candidate uncertain instances. After upgrading to the instance level, we select instances from the candidates for label enhancement, whereas they remained unchanged for the remaining. To the best of our knowledge, this is the first attempt to combine logical label learning with numerical label learning into a unified framework for minimizing classification uncertainty. Extensive experiments demonstrate that, with the selectively reconstructed label importance, IFTWLE achieves statistically superior over the state-of-the-art multi-label classification algorithms in terms of classification accuracy. The computational complexity of this algorithm is On2mk, where n, m, and k denote the unseen instances count, label count, and average label-specific feature size, respectively.

Classical radial basis function network (RBFN) is widely used to process the non-linear separable data sets with the introduction of activation functions. However, the setting of parameters for activation functions is random and the distribution of patterns is not taken into account. To process this issue, some scholars introduce the kernel clustering into the RBFN so that the clustering results are related to the parameters about activation functions. On the base of the original kernel clustering, this study further discusses the influence of kernel clustering on an RBFN when the setting of kernel clustering is changing. The changing involves different kernel-clustering ways [bubble sort (BS) and escape nearest outlier (ENO)], multiple kernel-clustering criteria (static and dynamic) etc. Experimental results validate that with the consideration of distribution of patterns and the changes of setting of kernel clustering, the performance of an RBFN is improved and is more feasible for corresponding data sets. Moreover, though BS always costs more time than ENO, it still brings more feasible clustering results. Furthermore, dynamic criterion always cost much more time than static one, but kernel number derived from dynamic criterion is fewer than the one from static.

In this paper, text representation and feature selection strategies for Chinese text classification based on n-grams are discussed. Two steps feature selection strategy is proposed which combines the preprocess within classes with the feature selection among classes. Four different feature selection methods and three text representation weights are compared by exhaustive experiments. Both C-SVC classifier and Naive bayes classifier are adopted to assess the results. All experiments are performed on Chinese corpus TanCorpV1.0 which includes more than 14,000 texts divided in 12 classes. Our experiments concern: (1) the performance comparison among different feature selection strategies: absolute text frequency, relative text frequency, absolute n-gram frequency and relative n-gram frequency; (2) the comparison of the sparseness and feature correlation in the “text by feature” matrices produced by four feature selection methods; (3) the performance comparison among three term weights: 0/1 logical value, n-gram frequency numeric value (TF) and Tf*idf value.