CAAI Transactions on Intelligence Technology
Volume 4, Issue 3, September 2019
Volumes & issues:
Volume 4, Issue 3
September 2019
-
- Author(s): Xinchao Zhao ; Maoguo Gong ; Xingquan Zuo ; Linqiang Pan
- Source: CAAI Transactions on Intelligence Technology, Volume 4, Issue 3, p. 127 –128
- DOI: 10.1049/trit.2019.0053
- Type: Article
- + Show details - Hide details
-
p.
127
–128
(2)
- Author(s): Xue Wang and Liwen Ma
- Source: CAAI Transactions on Intelligence Technology, Volume 4, Issue 3, p. 129 –134
- DOI: 10.1049/trit.2019.0008
- Type: Article
- + Show details - Hide details
-
p.
129
–134
(6)
The authors study the covering rough sets by topological methods. They combine the covering rough sets and topological spaces by means of defining some new types of spaces called covering rough topological (CRT) spaces based on neighbourhoods or complementary neighbourhoods. As the separation axioms play a fundamental role in general topology, they introduce all these axioms into covering rough set theories and thoroughly study the equivalent conditions for every separation axiom in several CRT spaces. They also investigate the relationships between the separation axioms in these special spaces and reveal these relationships through diagrams in different CRT spaces.
- Author(s): Xingsi Xue ; Jiawei Lu ; Junfeng Chen
- Source: CAAI Transactions on Intelligence Technology, Volume 4, Issue 3, p. 135 –141
- DOI: 10.1049/trit.2019.0014
- Type: Article
- + Show details - Hide details
-
p.
135
–141
(7)
To support semantic inter-operability between the biomedical information systems, it is necessary to determine the correspondences between the heterogeneous biomedical concepts, which is commonly known as biomedical ontology matching. Biomedical concepts are usually complex and ambiguous, which makes matching biomedical ontologies a challenge. Since none of the similarity measures can distinguish the heterogeneous biomedical concepts in any context independently, usually several similarity measures are applied together to determine the biomedical concepts mappings. However, the ignorance of the effects brought about by different biomedical concept mapping's preference on the similarity measures significantly reduces the alignment's quality. In this study, a non-dominated sorting genetic algorithm (NSGA)-III-based biomedical ontology matching technique is proposed to effectively match the biomedical ontologies, which first utilises an ontology partitioning technique to transform the large-scale biomedical ontology matching problem into several ontology segment-matching problems, and then uses NSGA-III to determine the optimal alignment without tuning the aggregating weights. The experiment is conducted on the anatomy track and large biomedic ontologies track which are provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with OAEI's participants show the effectiveness of the authors' approach.
- Author(s): Li Wang ; Xingmei Li ; Lu Zhao ; Zailing Liu
- Source: CAAI Transactions on Intelligence Technology, Volume 4, Issue 3, p. 142 –147
- DOI: 10.1049/trit.2019.0015
- Type: Article
- + Show details - Hide details
-
p.
142
–147
(6)
This research develops two new models for project portfolio selection, in which the candidate projects are composed of multiple repetitive units. To reflect some real situations, the learning effect is considered in the project portfolio selection problem for the first time. The mathematical representations of the relationship between learning experience and investment cost are provided. One numerical example under different scenarios is demonstrated and the impact of considering learning effect is then discussed.
- Author(s): Leonardo Ramos Rodrigues and João Paulo Pordeus Gomes
- Source: CAAI Transactions on Intelligence Technology, Volume 4, Issue 3, p. 148 –158
- DOI: 10.1049/trit.2018.1089
- Type: Article
- + Show details - Hide details
-
p.
148
–158
(11)
The teaching–learning-based optimisation (TLBO) algorithm is a population-based metaheuristic inspired on the teaching–learning process observed in a classroom. It has been successfully used in a wide range of applications. In this study, the authors present a variant version of TLBO. In the proposed version, different weights are assigned to students during the student phase, with higher weights being assigned to students with better solutions. Three different approaches to assign weights are investigated. Numerical experiments with benchmark instances of the flow-shop and the job-shop scheduling problems are carried out to investigate the performance of the proposed approaches. They compare the proposed approaches with the original TLBO algorithm and with two variants of TLBOs proposed in the literature in terms of solution quality, convergence speed and simulation time. The results obtained by the application of a Friedman statistical test showed that the proposed approaches outperformed the original version of TLBO in terms of convergence, with no significant losses in the average makespan. The additional simulation time required by the proposed approaches is small. The best performance was achieved with the approach of assigning a fixed weight to half the students with the best solutions and assigning zero to other students.
- Author(s): Xinchao Zhao ; Rui Li ; Xingquan Zuo
- Source: CAAI Transactions on Intelligence Technology, Volume 4, Issue 3, p. 159 –174
- DOI: 10.1049/trit.2019.0018
- Type: Article
- + Show details - Hide details
-
p.
159
–174
(16)
Service-oriented architecture is becoming a major software framework for complex application and it can be dynamically and flexibly composed by integrating existing component web services provided by different providers with standard protocols. The rapid introduction of new web services into a dynamic business environment can adversely affect the service quality and user satisfaction. Therefore, how to leverage, aggregate and make use of individual component's quality of service (QoS) information to derive the optimal QoS of the composite service which meets the needs of users is still an ongoing hot research problem. This study aims at reviewing the advance of the current state-of-the-art in technologies and inspiring the possible new ideas for web service selection and composition, especially with nature-inspired computing approaches. Firstly, the background knowledge of web services is presented. Secondly, various nature-inspired web selection and composition approaches are systematically reviewed and analysed for QoS-aware web services. Finally, challenges, remarks and discussions about QoS-aware web service composition are presented.
- Author(s): Totan Garai and Harish Garg
- Source: CAAI Transactions on Intelligence Technology, Volume 4, Issue 3, p. 175 –181
- DOI: 10.1049/trit.2019.0030
- Type: Article
- + Show details - Hide details
-
p.
175
–181
(7)
This study presented a multi-objective linear fractional inventory (LFI) problem with generalised intuitionistic fuzzy numbers. In modelling, the authors have assumed the ambiances where generalised trapezoidal intuitionistic fuzzy numbers (GTIFNs) used to handle the uncertain information in the data. Then, the given multi-objective generalised intuitionistic fuzzy LFI model was transformed into its equivalent deterministic linear fractional programming problem by employing the possibility and necessity measures. Finally, the applicability of the model is demonstrated with a numerical example and the sensitivity analysis under several parameters is investigated to explore the study.
- Author(s): Samih M. Mostafa
- Source: CAAI Transactions on Intelligence Technology, Volume 4, Issue 3, p. 182 –200
- DOI: 10.1049/trit.2019.0032
- Type: Article
- + Show details - Hide details
-
p.
182
–200
(19)
The concept of missing data is important to apply statistical methods on the dataset. Statisticians and researchers may end up to an inaccurate illation about the data if the missing data are not handled properly. Of late, Python and R provide diverse packages for handling missing data. In this study, an imputation algorithm, cumulative linear regression, is proposed. The proposed algorithm depends on the linear regression technique. It differs from the existing methods, in that it cumulates the imputed variables; those variables will be incorporated in the linear regression equation to filling in the missing values in the next incomplete variable. The author performed a comparative study of the proposed method and those packages. The performance was measured in terms of imputation time, root-mean-square error, mean absolute error, and coefficient of determination . On analysing on five datasets with different missing values generated from different mechanisms, it was observed that the performances vary depending on the size, missing percentage, and the missingness mechanism. The results showed that the performance of the proposed method is slightly better.
Guest Editorial: Advances in Bio-inspired Heuristics for Computing
Study on covering rough sets with topological methods
Using NSGA-III for optimising biomedical ontology alignment
Expanded models of the project portfolio selection problem with learning effect
TLBO with variable weights applied to shop scheduling problems
Advances on QoS-aware web service selection and composition with nature-inspired computing
Multi-objective linear fractional inventory model with possibility and necessity constraints under generalised intuitionistic fuzzy set environment
Imputing missing values using cumulative linear regression
Most viewed content
Most cited content for this Journal
-
Self‐training maximum classifier discrepancy for EEG emotion recognition
- Author(s): Xu Zhang ; Dengbing Huang ; Hanyu Li ; Youjia Zhang ; Ying Xia ; Jinzhuo Liu
- Type: Article
-
A robust deformed convolutional neural network (CNN) for image denoising
- Author(s): Qi Zhang ; Jingyu Xiao ; Chunwei Tian ; Jerry Chun‐Wei Lin ; Shichao Zhang
- Type: Article
-
Boosting image watermarking authenticity spreading secrecy from counting‐based secret‐sharing
- Author(s): Adnan Gutub
- Type: Article
-
A survey on adversarial attacks and defences
- Author(s): Anirban Chakraborty ; Manaar Alam ; Vishal Dey ; Anupam Chattopadhyay ; Debdeep Mukhopadhyay
- Type: Article
-
Deep learning: Applications, architectures, models, tools, and frameworks: A comprehensive survey
- Author(s): Mehdi Gheisari ; Fereshteh Ebrahimzadeh ; Mohamadtaghi Rahimi ; Mahdieh Moazzamigodarzi ; Yang Liu ; Pijush Kanti Dutta Pramanik ; Mohammad Ali Heravi ; Abolfazl Mehbodniya ; Mustafa Ghaderzadeh ; Mohammad Reza Feylizadeh ; Saeed Kosari
- Type: Article