21 results on '"Xu, Taihua"'
Search Results
2. SSGCN: a sampling sequential guided graph convolutional network
- Author
-
Wang, Xiaoxiao, Yang, Xibei, Wang, Pingxin, Yu, Hualong, and Xu, Taihua
- Published
- 2024
- Full Text
- View/download PDF
3. A meta-heuristic feature selection algorithm combining random sampling accelerator and ensemble using data perturbation
- Author
-
Zhang, Shuaishuai, Liu, Keyu, Xu, Taihua, Yang, Xibei, and Zhang, Ao
- Published
- 2023
- Full Text
- View/download PDF
4. Perturbation-augmented Graph Convolutional Networks: A Graph Contrastive Learning architecture for effective node classification tasks
- Author
-
Guo, Qihang, Yang, Xibei, Zhang, Fengjun, and Xu, Taihua
- Published
- 2024
- Full Text
- View/download PDF
5. Unsupervised attribute reduction: improving effectiveness and efficiency
- Author
-
Gong, Zhice, Liu, Yuxin, Xu, Taihua, Wang, Pingxin, and Yang, Xibei
- Published
- 2022
- Full Text
- View/download PDF
6. Triple-G: a new MGRS and attribute reduction
- Author
-
Ba, Jing, Liu, Keyu, Ju, Hengrong, Xu, Suping, Xu, Taihua, and Yang, Xibei
- Published
- 2022
- Full Text
- View/download PDF
7. A Granulation Strategy-Based Algorithm for Computing Strongly Connected Components in Parallel.
- Author
-
He, Huixing, Xu, Taihua, Chen, Jianjun, Cui, Yun, and Song, Jingjing
- Subjects
- *
GRANULATION , *GRANULAR computing , *ALGORITHMS , *PROBLEM solving , *PARALLEL algorithms - Abstract
Granular computing (GrC) is a methodology for reducing the complexity of problem solving and includes two basic aspects: granulation and granular-based computing. Strongly connected components (SCCs) are a significant subgraph structure in digraphs. In this paper, two new granulation strategies were devised to improve the efficiency of computing SCCs. Firstly, four SCC correlations between the vertices were found, which can be divided into two classes. Secondly, two granulation strategies were designed based on correlations between two classes of SCCs. Thirdly, according to the characteristics of the granulation results, the parallelization of computing SCCs was realized. Finally, a parallel algorithm based on granulation strategy for computing SCCs of simple digraphs named GPSCC was proposed. Experimental results show that GPSCC performs with higher computational efficiency than algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
8. Optimizing Attribute Reduction in Multi-Granularity Data through a Hybrid Supervised–Unsupervised Model.
- Author
-
Fan, Zeyuan, Chen, Jianjun, Cui, Hongyang, Song, Jingjing, and Xu, Taihua
- Subjects
ROUGH sets ,DATA reduction ,SUPERVISED learning ,DIMENSION reduction (Statistics) - Abstract
Attribute reduction is a core technique in the rough set domain and an important step in data preprocessing. Researchers have proposed numerous innovative methods to enhance the capability of attribute reduction, such as the emergence of multi-granularity rough set models, which can effectively process distributed and multi-granularity data. However, these innovative methods still have numerous shortcomings, such as addressing complex constraints and conducting multi-angle effectiveness evaluations. Based on the multi-granularity model, this study proposes a new method of attribute reduction, namely using multi-granularity neighborhood information gain ratio as the measurement criterion. This method combines both supervised and unsupervised perspectives, and by integrating multi-granularity technology with neighborhood rough set theory, constructs a model that can adapt to multi-level data features. This novel method stands out by addressing complex constraints and facilitating multi-perspective effectiveness evaluations. It has several advantages: (1) it combines supervised and unsupervised learning methods, allowing for nuanced data interpretation and enhanced attribute selection; (2) by incorporating multi-granularity structures, the algorithm can analyze data at various levels of granularity. This allows for a more detailed understanding of data characteristics at each level, which can be crucial for complex datasets; and (3) by using neighborhood relations instead of indiscernibility relations, the method effectively handles uncertain and fuzzy data, making it suitable for real-world datasets that often contain imprecise or incomplete information. It not only selects the optimal granularity level or attribute set based on specific requirements, but also demonstrates its versatility and robustness through extensive experiments on 15 UCI datasets. Comparative analyses against six established attribute reduction algorithms confirms the superior reliability and consistency of our proposed method. This research not only enhances the understanding of attribute reduction mechanisms, but also sets a new benchmark for future explorations in the field. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
9. Multi-granularity distance measure for interval-valued intuitionistic fuzzy concepts
- Author
-
Li, Shuai, Yang, Jie, Wang, Guoyin, and Xu, Taihua
- Published
- 2021
- Full Text
- View/download PDF
10. Finding strongly connected components of simple digraphs based on granulation strategy
- Author
-
Xu, Taihua, Wang, Guoyin, and Yang, Jie
- Published
- 2020
- Full Text
- View/download PDF
11. Forward Greedy Searching to κ -Reduct Based on Granular Ball.
- Author
-
Song, Minhui, Chen, Jianjun, Song, Jingjing, Xu, Taihua, and Fan, Yan
- Subjects
ROUGH sets - Abstract
As a key part of data preprocessing, namely attribute reduction, is effectively applied in the rough set field. The purpose of attribute reduction is to prevent too many attributes from affecting classifier operations and reduce the dimensionality of data space. Presently, in order to further improve the simplification performance of attribute reduction, numerous researchers have proposed a variety of methods. However, given the current findings, the challenges are: to reasonably compress the search space of candidate attributes; to fulfill multi-perspective evaluation; and to actualize attribute reduction based on guidance. In view of this, forward greedy searching to κ -reduct based on granular ball is proposed, which has the following advantages: (1) forming symmetrical granular balls to actualize the grouping of the universe; (2) continuously merging small universes to provide guidance for subsequent calculations; and (3) combining supervised and unsupervised perspectives to enrich the viewpoint of attribute evaluation and better improve the capability of attribute reduction. Finally, based on three classifiers, 16 UCI datasets are used to compare our proposed method with six advanced algorithms about attribute reduction and an algorithm without applying any attribute reduction algorithms. The experimental results indicate that our method can not only ensure the result of reduction has considerable performance in the classification test, but also improve the stability of attribute reduction to a certain degree. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
12. Multi-Scale Annulus Clustering for Multi-Label Classification.
- Author
-
Liu, Yan, Liu, Changshun, Song, Jingjing, Yang, Xibei, Xu, Taihua, and Wang, Pingxin
- Subjects
CLASSIFICATION ,HIERARCHICAL clustering (Cluster analysis) ,SAMPLE size (Statistics) - Abstract
Label-specific feature learning has become a hot topic as it induces classification models by accounting for the underlying features of each label. Compared with single-label annotations, multi-label annotations can describe samples from more comprehensive perspectives. It is generally believed that the compelling classification features of a data set often exist in the aggregation of label distribution. In this in-depth study of a multi-label data set, we find that the distance between all samples and the sample center is a Gaussian distribution, which means that the label distribution has the tendency to cluster from the center and spread to the surroundings. Accordingly, the double annulus field based on this distribution trend, named DEPT for double annulusfield and label-specific features for multi-label classification, is proposed in this paper. The double annulus field emphasizes that samples of a specific size can reflect some unique features of the data set. Through intra-annulus clustering for each layer of annuluses, the distinctive feature space of these labels is captured and formed. Then, the final classification model is obtained by training the feature space. Contrastive experiments on 10 benchmark multi-label data sets verify the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
13. Attribute Reduction Based on Lift and Random Sampling.
- Author
-
Chen, Qing, Xu, Taihua, and Chen, Jianjun
- Subjects
- *
ROUGH sets , *STATISTICAL sampling , *FEATURE selection - Abstract
As one of the key topics in the development of neighborhood rough set, attribute reduction has attracted extensive attentions because of its practicability and interpretability for dimension reduction or feature selection. Although the random sampling strategy has been introduced in attribute reduction to avoid overfitting, uncontrollable sampling may still affect the efficiency of search reduct. By utilizing inherent characteristics of each label, Multi-label learning with Label specIfic FeaTures (Lift) algorithm can improve the performance of mathematical modeling. Therefore, here, it is attempted to use Lift algorithm to guide the sampling for reduce the uncontrollability of sampling. In this paper, an attribute reduction algorithm based on Lift and random sampling called ARLRS is proposed, which aims to improve the efficiency of searching reduct. Firstly, Lift algorithm is used to choose the samples from the dataset as the members of the first group, then the reduct of the first group is calculated. Secondly, random sampling strategy is used to divide the rest of samples into groups which have symmetry structure. Finally, the reducts are calculated group-by-group, which is guided by the maintenance of the reducts' classification performance. Comparing with other 5 attribute reduction strategies based on rough set theory over 17 University of California Irvine (UCI) datasets, experimental results show that: (1) ARLRS algorithm can significantly reduce the time consumption of searching reduct; (2) the reduct derived from ARLRS algorithm can provide satisfying performance in classification tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. Label-specific guidance for efficiently searching reduct.
- Author
-
Lu, Yu, Song, Jingjing, Wang, Pingxin, and Xu, Taihua
- Subjects
GRANULAR computing ,FEATURE selection ,TASK performance ,BIG data ,ROUGH sets - Abstract
In the era of big data for exploring attribute reduction/rough set-based feature selection related problems, to design efficient strategies for deriving reducts and then reduce the dimensions of data, two fundamental perspectives of Granular Computing may be taken into account: breaking up the whole into pieces and gathering parts into a whole. From this point of view, a novel strategy named label-specific guidance is introduced into the process of searching reduct. Given a formal description of attribute reduction, by considering the corresponding constraint, we divide it into several label-specific based constraints. Consequently, a sequence of these label-specific based constraints can be obtained, it follows that the reduct related to the previous label-specific based constraint may have guidance on the computation of that related to the subsequent label-specific based constraint. The thinking of this label-specific guidance runs through the whole process of searching reduct until the reduct over the whole universe is derived. Compared with five state-of-the-art algorithms over 20 data sets, the experimental results demonstrate that our proposed acceleration strategy can not only significantly accelerate the process of searching reduct but also offer justifiable performance in the task of classification. This study suggests a new trend concerning the problem of quickly deriving reduct. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. A Force-Directed Algorithm for Drawing Directed Graphs Symmetrically.
- Author
-
Xu, Taihua, Yang, Jie, and Gou, Guanglei
- Subjects
- *
DIRECTED graphs , *SUBGRAPHS , *ALGORITHMS , *GEOMETRIC vertices , *MATHEMATICAL models - Abstract
Symmetry is one of the most important aesthetic criteria on graph drawing. It is quite necessary to measure the extent to which the drawings can be considered symmetric. For this purpose, a symmetric metric based on vertex coordinate calculation is proposed in this paper. It is proven theoretically and experimentally that the proposed metric is robust to contraction, expansion, and rotation of drawings. This robustness conforms to human perception of symmetry. Star-subgraphs and cycles are two common structures in digraphs. Both of them have inherent symmetry which should be displayed in drawings. For this purpose, a force-directed algorithm named FDS is proposed which can draw star-subgraphs and cycles as symmetrically as possible. FDS algorithm draws cycles as circles whose positions are fixed to provide a scaffolding for overall layout, renders non-leaf vertices by a standard force-directed layout, and places leaf vertices on concentric circles via a deterministic strategy. A series of experiments are carried out to test FDS algorithm. The results show that FDS algorithm draws digraphs more symmetrically than the existing state-of-the-art algorithms and performs efficiency comparable to O(nlogn) YFHu algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
16. Modified Uncertainty Measure of Rough Fuzzy Sets from the Perspective of Fuzzy Distance.
- Author
-
Yang, Jie, Xu, Taihua, and Zhao, Fan
- Subjects
- *
FUZZY sets , *SET theory , *ARTIFICIAL intelligence , *COMPUTER software , *APPROXIMATION theory - Abstract
As an extension of Pawlak’s rough sets, rough fuzzy sets are proposed to deal with fuzzy target concept. As we know, the uncertainty of Pawlak’s rough sets is rooted in the objects contained in the boundary region, while the uncertainty of rough fuzzy sets comes from three regions (positive region, boundary region, and negative region). In addition, in the view of traditional uncertainty measures, the two rough approximation spaces with the same uncertainty are not necessarily equivalent, and they cannot be distinguished. In this paper, firstly, a fuzziness-based uncertainty measure is proposed. Meanwhile, the essence of the uncertainty for rough fuzzy sets and its three regions in a hierarchical granular structure is revealed. Then, from the perspective of fuzzy distance, we introduce a modified uncertainty measure based on the fuzziness-based uncertainty measure and present that our method not only is strictly monotonic with finer approximation spaces, but also can distinguish the two rough approximation spaces with the same uncertainty. Finally, a case study is introduced to demonstrate that the modified uncertainty measure is more suitable for evaluating the significance of attributes. These works are useful for further study on rough sets theory and promote the development of uncertain artificial intelligence. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
17. Finding strongly connected components of simple digraphs based on generalized rough sets theory.
- Author
-
Xu, Taihua and Wang, Guoyin
- Subjects
- *
ROUGH sets , *GRAPH theory , *PROBLEM solving , *DIRECTED graphs , *GRAPH connectivity , *ALGORITHMS - Abstract
Rough sets theory is not good at discovering knowledge from digraphs which is a kind of relational data. In order to solve this problem, we introduce binary relations derived from simple digraphs and propose a new concept of k -step R -related set in the framework of generalized rough sets theory. In addition, we first investigate the relationships between generalized rough sets theory and graph theory on the basis of mutual representation between binary relations and digraphs. The relationships established in this work make it possible to use generalized rough sets theory to find strongly connected components of simple directed graphs, which previously can be solved only by graph algorithms. An algorithm is correspondingly developed based on the above works, especially k -step R -related set. A series of experiments are carried out to test the proposed algorithm. The results show that our algorithm provides comparable performance to the classical Tarjan algorithm. In addition, the proposed algorithm can be implemented in parallel. And its parallel performance is comparable to existing state-of-the-art parallel algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
18. Beam-Influenced Attribute Selector for Producing Stable Reduct.
- Author
-
Yan, Wangwang, Ba, Jing, Xu, Taihua, Yu, Hualong, Shi, Jinlong, and Han, Bin
- Subjects
ROUGH sets ,FEATURE selection - Abstract
Attribute reduction is a critical topic in the field of rough set theory. Currently, to further enhance the stability of the derived reduct, various attribute selectors are designed based on the framework of ensemble selectors. Nevertheless, it must be pointed out that some limitations are concealed in these selectors: (1) rely heavily on the distribution of samples; (2) rely heavily on the optimal attribute. To generate the reduct with higher stability, a novel beam-influenced selector (BIS) is designed based on the strategies of random partition and beam. The scientific novelty of our selector can be divided into two aspects: (1) randomly partition samples without considering the distribution of samples; (2) beam-based selections of features can save the selector from the dependency of the optimal attribute. Comprehensive experiments using 16 UCI data sets show the following: (1) the stability of the derived reducts may be significantly enhanced by using our selector; (2) the reducts generated based on the proposed selector can provide competent performance in classification tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
19. Optimal granularity selection based on cost-sensitive sequential three-way decisions with rough fuzzy sets.
- Author
-
Yang, Jie, Wang, Guoyin, Zhang, Qinghua, Chen, Yuhong, and Xu, Taihua
- Subjects
- *
FUZZY sets , *ROUGH sets , *DECISION making , *PROBLEM solving , *MATHEMATICAL optimization - Abstract
Abstract As an extension of Pawlak's rough sets, rough fuzzy sets is proposed to deal with the target concept which is typically fuzzy or uncertain. It is worthwhile to introduce cost-sensitive learning into granular computing, as the granularity with the optimal cost can be selected. In the terms of decision making, test cost and decision cost are the most popular cost types. In the sequential three-way decisions (S3WD) models, the granularity is sensitive to the test cost. Meanwhile, the accuracy is sensitive to the decision cost. Selecting an optimal cost-sensitive granularity for problem solving is helpful for achieving optimal results at the lowest total cost in S3WD. However, it is difficult to evaluate test cost precisely and objectively in real-life applications, and existing works only focus on searching for the total cost as the objective function. In this paper, we firstly present a sequential three-way decisions model with rough fuzzy sets (S3WDRFS). Then, for S3WDRFS and its three regions, the changing rules of their decision cost are revealed in a hierarchical granular structure. By considering user requirements, we propose an optimization mechanism to achieve the optimal cost-sensitive granularity selection based on S3WDRFS model. Finally, the experimental results demonstrate that exemplary optimal granularities can be obtained for high quality decision-making under certain constraints. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
20. A novel approach for calculating single-source shortest paths of weighted digraphs based on rough sets theory.
- Author
-
Hua M, Xu T, Yang X, Chen J, and Yang J
- Abstract
Calculating single-source shortest paths (SSSPs) rapidly and precisely from weighted digraphs is a crucial problem in graph theory. As a mathematical model of processing uncertain tasks, rough sets theory (RST) has been proven to possess the ability of investigating graph theory problems. Recently, some efficient RST approaches for discovering different subgraphs (e.g. strongly connected components) have been presented. This work was devoted to discovering SSSPs of weighted digraphs by aid of RST. First, SSSPs problem was probed by RST, which aimed at supporting the fundamental theory for taking RST approach to calculate SSSPs from weighted digraphs. Second, a heuristic search strategy was designed. The weights of edges can be served as heuristic information to optimize the search way of $ k $-step $ R $-related set, which is an RST operator. By using heuristic search strategy, some invalid searches can be avoided, thereby the efficiency of discovering SSSPs was promoted. Finally, the W3SP@R algorithm based on RST was presented to calculate SSSPs of weighted digraphs. Related experiments were implemented to verify the W3SP@R algorithm. The result exhibited that W3SP@R can precisely calculate SSSPs with competitive efficiency.
- Published
- 2024
- Full Text
- View/download PDF
21. Element detection and segmentation of mathematical function graphs based on improved Mask R-CNN.
- Author
-
Lu J, Chen J, Xu T, Song J, and Yang X
- Abstract
There are approximately 2.2 billion people around the world with varying degrees of visual impairments. Among them, individuals with severe visual impairments predominantly rely on hearing and touch to gather external information. At present, there are limited reading materials for the visually impaired, mostly in the form of audio or text, which cannot satisfy the needs for the visually impaired to comprehend graphical content. Although many scholars have devoted their efforts to investigating methods for converting visual images into tactile graphics, tactile graphic translation fails to meet the reading needs of visually impaired individuals due to image type diversity and limitations in image recognition technology. The primary goal of this paper is to enable the visually impaired to gain a greater understanding of the natural sciences by transforming images of mathematical functions into an electronic format for the production of tactile graphics. In an effort to enhance the accuracy and efficiency of graph element recognition and segmentation of function graphs, this paper proposes an MA Mask R-CNN model which utilizes MA ConvNeXt as its improved feature extraction backbone network and MA BiFPN as its improved feature fusion network. The MA ConvNeXt is a novel feature extraction network proposed in this paper, while the MA BiFPN is a novel feature fusion network introduced in this paper. This model combines the information of local relations, global relations and different channels to form an attention mechanism that is able to establish multiple connections, thus increasing the detection capability of the original Mask R-CNN model on slender and multi-type targets by combining a variety of multi-scale features. Finally, the experimental results show that MA Mask R-CNN attains an 89.6% mAP value for target detection and 72.3% mAP value for target segmentation in the instance segmentation of function graphs. This results in a 9% mAP improvement for target detection and 12.8% mAP improvement for target segmentation compared to the original Mask R-CNN.
- Published
- 2023
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.