A5100301403- Rough Sets and Fuzzy Logic
- Advanced Computational Techniques and Applications
- Data Mining Algorithms and Applications
- Advanced Decision-Making Techniques
- Extenics and Innovation Methods
- Data Management and Algorithms
- Multi-Criteria Decision Making
- Fuzzy Logic and Control Systems
- Fuzzy Systems and Optimization
- AI-based Problem Solving and Planning
- Risk and Portfolio Optimization
- Evaluation Methods in Various Fields
- Advanced Algorithms and Applications
- Ideological and Political Education
- Semantic Web and Ontologies
- Industrial Technology and Control Systems
- Time Series Analysis and Forecasting
- Natural Language Processing Techniques
- Criminal Law and Evidence
- Logic, Reasoning, and Knowledge
- Text and Document Classification Technologies
- Advanced Text Analysis Techniques
- RNA modifications and cancer
- Landslides and related hazards
- Legal Studies and Policies
Chongqing Medical University
2024-2025
The Affiliated Yongchuan Hospital of Chongqing Medical University
2024-2025
Affiliated Hospital of Nantong University
2020
Nantong University
2020
Guangxi Normal University
2000-2014
Shougang Institute of Technology
2010
University of Science and Technology Beijing
2006-2009
Beijing Information Science & Technology University
2006-2009
Nanning Normal University
2009
Zhaoqing University
2004-2007
Abstract Objective To investigate the anatomic risk factors of knee in patients with acute non-contact anterior cruciate ligament (aACL) ruptures to develop ramp lesions. Methods A total 202 subjects were retrospectively divided into three groups: (1) aACL combined lesions group ( n = 76); (2) isolated ACL 56) and (3) normal controls 70). Quantitative morphological parameters on MRI measured including: diameter medial femoral condyle (MFC), anterior-posterior length depth tibial plateau (MTP...
Lumbosacral transitional vertebra (LSTV) is a common spinal variant, with the reported prevalence varying from 8.1% to 36%. LSTV has been shown alter lumbo-pelvic parameters and reduce benefits of total hip arthroplasty, but specific effects on development remain unclear. The aim this study was thus investigate impact developmental alterations hip.
Because of the inherent computational complexity, mining complete frequent item-set in dense datasets remains to be a challenging task. Mining Maximal Frequent Item-set (MFI) is an alternative address problem. Set-Enumeration Tree (SET) common data structure used several MFI algorithms. For this kind algorithm, process MFI's can also viewed as searching set-enumeration tree. To reduce search space, paper, new Index-MaxMiner, for proposed by employing hybrid strategy blending breadth-first...
At present, some researchers provide a type of fuzzy risk analysis algorithm for dealing with problems, where the values evaluating items are represented by trapezoidal numbers. In this method, main operations two: one is arithmetic operators numbers; other similarity The proposed method provides useful way to deal problems. paper, we first analyze drawbacks numbers and Then propose new numbers, improved same time, use an example illustrate approach.
The set of frequent closed itemsets determines exactly the complete all and is usually much smaller than latter. This paper proposes an improved algorithm for mining itemsets. Firstly, index array p
The most issue is designing the fitness function of chromosome when generic algorithm been used for calculating minimal attribute reduction in rough set theory. But with existed chromosome, one that value larger might not be an reduction. So optimization candidate What more, during crossover and mutation process, it could delete which To solve mentioned problems speed up convergence speed. In this paper, a new introduced, proved must It also can process. Then efficient based on genetic...
Rough set theory is emerging as a powerful toll for reasoning about data. Attribute reduction one of important topics in the research on rough theory. At present, there few researchers investigated attribute based incomplete decision table. Since computing table more difficult than that complete table, designed algorithms are no better those The time complexity existed algorithm O(|C| <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> |U|...
The elements of discernibility matrix are used as the heuristic information by all existing attribute reduction algorithms based on matrix. time and space complexities this kind O(\C\ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> |U\ ). To lower complexities, simplified decision table is introduced, proved that non-empty same old Then, using frequency appearing in information, an efficient algorithm Skowron proposed, cut down to...
Interleukin-enhancer binding factor 3 (ILF3) is a double-stranded RNA-binding protein that has been reported to contribute the occurrence and progression of various malignant tumors. The aim present study was evaluate prognostic value ILF3 apply this knowledge avoid excessive medical treatment in patients with lung adenocarcinoma (LUAD). expression discovery set consisting tumor peri-tumor tissue microarrays analyzed using immunohistochemical methods. mRNA level subsequently validation...
Landslides are among the most devastating natural disasters worldwide. Landslide susceptibility mapping (LSM) is a scientific approach for assessing areas prone to landslides. Despite use of various statistical and machine learning (ML) models predict landslide susceptibility, few studies have addressed spatial heterogeneity Consequently, accuracy prediction at local scale remains inadequate. This paper introduces geographically weighted neural network (GWNN) model, which addresses effect in...
The research of knowledge granularity has been a hotspot at home and abroad. In incomplete information systems the rough set, we give formula, which calculates attribute frequency directly without acquiring discernibility matrix. Then applying it to field granularity, quick calculation reduction algorithm, time complexity is O(|C| <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> |U |) in worst case. example result shows that algorithm...
Abstract The sheer size of all frequent itemsets is one challenging problem in data mining research. Based on both closed itemset and maximal itemset, meta which a new concise representation proposed. It proved that are special cases itemset. set the form upper bound lower itemsets. Then, property pruning strategies discussed. Finally, an efficient algorithm for Experimental results show proposed effective efficient. Keywords: miningassociation ruleclosed itemsetmaximal itemsetmeta...
Some scholars provided the discernibility matrix based on positive region. The time complexity of algorithm for computing core with this is O(|CparU| <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ). For cutting down algorithm, definition simplified region and corresponding are provided. At same time, it proved that equivalent to Since partition U/C key process matrix, a quick designed idea radix sorting. Its O(|CparU|). On condition,...