Search

Literature reviews are essential for any researcher trying to keep up to date with the burgeoning software engineering literature. FAST$^2$ is a novel tool for reducing the effort required for conducting literature reviews by assisting the researchers to find the next promising paper to read (among a set of unread papers). This paper describes FAST$^2$ and tests it on four large software engineering literature reviews conducted by Wahono (2015), Hall (2012), Radjenovi\'c (2013) and Kitchenham (2017). We find that FAST$^2$ is a faster and robust tool to assist researcher finding relevant SE papers which can compensate for the errors made by humans during the review process. The effectiveness of FAST$^2$ can be attributed to three key innovations: (1) a novel way of applying external domain knowledge (a simple two or three keyword search) to guide the initial selection of papers---which helps to find relevant research papers faster with less variances; (2) an estimator of the number of remaining relevant papers yet to be found---which in practical settings can be used to decide if the reviewing process needs to be terminated; (3) a novel self-correcting classification algorithm---automatically corrects itself, in cases where the researcher wrongly classifies a paper., Comment: 20+3 pages, 6 figures, 5 tables, and 4 algorithms. Accepted by Journal of Expert Systems with Applications

In this paper, we present a novel deep learning-based architecture, which is under the scope of expert and intelligent systems, to perform accurate real-time tridimensional hand pose estimation using a single RGB frame as an input, so there is no need to use multiple cameras or points of view, or RGB-D devices. The proposed pipeline is composed of two convolutional neural network architectures. The first one is in charge of detecting the hand in the image. The second one is able to accurately infer the tridimensional position of the joints retrieving, thus, the full hand pose. To do this, we captured our own large-scale dataset composed of images of hands and the corresponding 3D joints annotations. The proposal achieved a 3D hand pose mean error of below 5 mm on both the proposed dataset and Stereo Hand Pose Tracking Benchmark, which is a public dataset. Our method also outperforms the state-of-the-art methods. We also demonstrate in this paper the application of the proposal to perform a robotic hand teleoperation with high success. This work has been supported by the Spanish Government TIN2016-76515R Grant, supported with Feder funds. This work has also been supported by a Spanish grant for PhD studies ACIF/2017/243

Acquiring knowledge for conversation modeling is an important task in the process of building a Conversational Agent (Chatbot). However, it is a quite difficult process that requires too much time and efforts. To overcome these difficulties, in this paper, we demonstrate a novel methodology for the automatic conversational knowledge extraction from an existing Chatbot. Extracted knowledge will be used as training dataset for building a Neural Network Conversational Agent. The experiments in the paper show that our proposed approach can be used for the automatic knowledge extraction from any type of Chatbot on the Internet. The experiment that is presented in this paper has two phases. In the first phase, we present a methodology for the conversational knowledge extraction. In the second phase of the experiment, we introduce a methodology for building a new Neural Conversational Agent using a deep learning Neural Network framework. The key novelty of our proposed approach is the automated machine-machine conversational knowledge sharing and reuse. This is an important step towards building the new conversational agents skipping the difficult and time-consuming procedure of knowledge acquisition.

This paper presents a new image processing and analysis technique for the quality evaluation of cell nuclei to support medical diagnostics in breast cancer. The technique allows cell nuclei that are deformed or overlapped by biological material to be reconstructed. The paper proposes a sensitivity and similarity approach, enriching the PatchMatch correspondence algorithm in accurate cell reconstruction. Its application in reconstruction processes enables accelerated computations and an increased probability of obtaining appropriate segmentation results. The numerical results demonstrate that the developed system allows for automatic and effective cell nuclei reconstruction with an acceptable average area accuracy level above 85% compared with manual human results (assuming manual segmentation as a true value). The reconstruction system allows for the recovery of the proper shape of the analyzed distorted cells very rapidly and in a repeatable manner. An additional advantage of the procedure is that the nuclei area overlapped by artifacts or other cells can be determined. The experimental results prove the high utility of the method in final HER2 gene amplification assessment in breast cancer images.

Value efficiency analysis is an approach to incorporate the Decision-Maker's (DM) priori knowledge (preference information) into efficiency analysis. This paper presents a multi-objective programming model to measure the value efficiency. The model's feasible region is the production possibility set in data envelopment analysis (DEA) and the objective functions are the value efficiency scores corresponding to input and output components. Considering the structure of the proposed model and the concept of value efficiency, the step method (STEM) method to solve the model and gain the value efficiency is used in this paper. By selecting MPU (most preferred unit) units based on the manager's choice, the suitable benchmarks and value efficiency scores could be obtained corresponding to the unit under evaluation, then one could see that the obtained benchmarks and value efficiency scores are strongly dependent on the selected MPU units. Finally, a numerical example is proposed to illustrate the credit of the proposed approach. The method has been applied for real world data.

Many clustering algorithms categorized as K-clustering algorithm require the user to predict the number of clusters (K) to do clustering. Due to lack of domain knowledge an accurate value of K is difficult to predict. The problem becomes critical when the dimensionality of data points is large; clusters differ widely in shape, size, and density; and when clusters are overlapping in nature. Determining the suitable K is an optimization problem. Automatic clustering algorithms can discover the optimal K. This paper presents an automatic clustering algorithm which is superior to K-clustering algorithm as it can discover an optimal value of K. Iterative hill-climbing algorithms like K-Means work on a single solution and converge to a local optimum solution. Here, Genetic Algorithms (GAs) find out near global optimum solutions, i.e. optimal K as well as the optimal cluster centroids. Single-objective clustering algorithms are adequate for efficiently grouping linearly separable clusters. For non-linearly separable clusters they are not so good. So for grouping non-linearly separable clusters, we apply Multi-Objective Genetic Algorithm (MOGA) by minimizing the intra-cluster distance and maximizing inter-cluster distance. Many existing MOGA based clustering algorithms are suitable for either numeric or categorical features. This paper pioneered employing MOGA for automatic clustering with mixed types of features. Statistical testing on experimental results on real-life benchmark data sets from the University of California at Irvine (UCI) machine learning repository proves the superiority of the proposed algorithm.

Text summarization has become an important research area, especially in the biomedical domain, where information overload is a major problem. In this paper, we propose a novel biomedical text summarization system that combines two popular data mining techniques: clustering and frequent itemset mining. Biomedical paper is expressed as a set of biomedical concepts using the UMLS metathesaurus. The K-means algorithm is used to cluster similar sentences. Then, the Apriori algorithm is applied to discover the frequent itemsets among the clustered sentences. Finally, the salient sentences from each cluster are selected to build the summary using the discovered frequent itemsets. For the evaluation step, we selected randomly 100 biomedical papers from the BioMed Central database full-text, and we evaluated the performances of our system by comparing the resulting summaries with the abstracts of these papers using the ROUGE metrics in term of recall, precision, and F-measure. We also compared the obtained summaries with those achieved by five well-known summarizers: TextRank, TextTeaser, SweSum, ItemSet Based Summarizer, Microsoft AutoSummarize, and two baselines: summarization using only the frequent itemsets mining (FRQ-CL), and summarization using only the clustering (CL-FRQ). The results demonstrate that this combination can successfully enhance the summarization performances, and the proposed system outperforms other tested summarizers.

This research introduces the Recursive General Regression Neural Network Oracle (R-GRNN Oracle) and is demonstrated on several binary classification datasets. The traditional GRNN Oracle classifier (Masters et al., 1998) combines the predictive powers of several machine learning classifiers by weighing the amount of error each classifier has on the final predictions. Each classifier is assigned a weight based on the percentage of errors it contributes to the final predictions as the classifiers evaluate the dataset. The proposed R-GRNN Oracle is an enhancement to the GRNN Oracle in which the proposed algorithm consists of an oracle within an oracle – where the inner oracle acts as a classifier with its own predictions and error contribution. By combining the inner oracle with other classifiers, the R-GRNN Oracle produces superior results. The classifiers considered in this study are: Support Vector Machine (SVM), Multilayer Perceptron (MLP), Probabilistic Neural Network (PNN), Gaussian Naive Bayes (GNB), K-Nearest Neighbor (KNN), and Random Forest (RF). To demonstrate the effectiveness of the proposed approach, several datasets were used, with the primary one being the publicly available Spambase dataset. The predictions of SVM, MLP, KNN, and RF were used to create the first GRNN Oracle, which was then enhanced with the high performances of SVM and RF to create the second oracle, the R-GRNN Oracle. The combined recursive model was 93.24% accurate using 10-fold cross validation, higher than the 91.94% of the inner GRNN Oracle and the 91.29% achieved by RF, the highest performance by a stand-alone classifier. The R-GRNN Oracle was not only the most accurate, but it also had the highest AUC, sensitivity, specificity, precision, and F1-score (97.99%, 91.86%, 94.40%, 93.28%, and 92.57%, respectively). The research contribution of this paper is introducing the concept of recursion (a concept not fully explored in machine learning models and applications) and testing this structure's ability on further enhancing the performance of the traditional oracle. The recursive model has also been applied to several other datasets: The Human Resources, Bank Marketing, and Monoclonal Gammopathy of Undetermined Significance (MGUS) datasets. The results of these implementations are summarized in this paper.

This paper proposes a method of recognizing the intention of human activity based on percept sequences that represent the activities of daily living (ADL) in a residential space. Based on the activity intention ontology representing actions, poses, and nearby objects related to human activity intentions, the proposed method identifies a human activity intention by using the event calculus when a percept sequence is entered. It is very difficult to recognize ADL occurring in various places in a residence by using regular percept sequences without error. Furthermore, a human activity can have complex intentions. To solve these problems, this paper proposes an activity intention recognition process consisting of three steps. First, the activity intention inference step recognizes the intention of a given percept sequence based on the activity intention ontology. Second, the complex intention-identifying step determines whether to terminate the previously maintained activity intention or continue maintaining it in a complex manner based on the newly inferred activity intention. Third, the uncertainty handling step corrects an inaccurate activity intention caused by an error in the percept sequence. To evaluate the proposed method presented in this paper, activity intention recognition experiments were conducted based on the ADL data that were collected for six households of elderly persons older than 70 years. The results showed that the proposed method has a precision of 99.62% and recall of 92.83%.

This paper presents a new semantic kernel for classification of high-dimensional data in the framework of Support Vector Machines (SVM). SVMs have gained widespread application due to their relatively higher accuracy. The efficacy of SVMs, however, depends upon the separation of the data itself as well as the kernel function. Text data, for instance, is difficult to classify due to synonymy and polysemy in its contents, having multi-topical instances that can result in mislabeling, and being highly sparse in the bag-of-words representation. While the soft margin parameter and kernel tricks are used in SVM to deal with outliers and non-linearly separable data, using data statistics and correlation has not been fully explored in the literature. This paper explore the use co-similarity (i.e., soft co-clustering) to find latent relationships between documents motivated by the success of co-clustering and subspace clustering methods. It has been shown that the use of weighted higher-order paths between instances in the data can be a good measure of similarity values which can then be used for both classification and to correct mislabeled (or outlier) data in the training set. The proposed kernel is generic in nature and suitable for sparse, dyadic data where direct co-occurrences are not necessary common as in the case of textual data, link-analysis in social media networks, co-authorship, etc. It also studies the impact of noise in the training data and provides a technique to re-label such instances. It is also observed that re-labelling of selected training data reduces the adverse effect of outliers or label noise and can greatly improve the classification of the test data. To the best of our knowledge, we are the first to introduce a supervised co-similarity based kernel function and also provide mathematical formulation to show that it is a valid Mercer's kernel. Our experiments show that the proposed framework outperforms current and state-of-the-art methods in terms of classification accuracy and is more resilient to label noise.

Software clone detection is an emerging research area in the field of software engineering. Software systems are subjected to continuous modifications in source code to improve the performance of the software, which may lead to code redundancy. Duplicate code/code clone is a piece of code reworked several times in software programs due to copy paste activity or reusability of existing software. Code clone is a prime subject in software evolution. Detection of software clones at the time of software evolution may improve the performance of software and reduce the maintenance cost and effort. This paper proposes metric based methods to detect code clones, as software clone is a universal problem in large scale programming environment. This paper introduces two metric based approaches to detect code clones by comparing (i) Control Statement Features (ii) Program Features like different types of statements, operators and operands. In order to demonstrate the effectiveness of the proposed approaches, extensive experiments are conducted on two datasets, C projects of Bellon's benchmark dataset and student lab programs (SLP).The methods efficiently identify similar functional clones. Proposed models only find similarity of whole programs but intelligent enough to highlight similar code segments across program files.

Low quality of business process event logs, as determined by anomalous and missing values, is often unavoidable in practical contexts. The output of process analysis that uses event logs with missing and anomalous values is also likely to be of low quality, thus decreasing the quality of any decisions based on it. While previous work has focused on reconstructing missing events in an event log or removing anomalous traces, in this paper we focus on detecting anomalous values and reconstructing missing values at the level of attributes in event logs. We propose methods based on autoencoders, which are a class of neural networks that can reconstruct their own input and are particularly suitable to learn a model of the complex relationships among attribute values in an event log. These methods do not rely on any a-priori knowledge about the business process that generated an event log and are evaluated using real world and artificially-generated event logs. The paper also discusses a qualitative analysis of the impact of event log cleaning and reconstruction on the output of process discovery. The proposed approach shows remarkable performance regarding activity labels and timestamps in artificial event logs. The performance in the case of real world event logs, in particular timestamp anomaly detection, is lower, which may be due to high variability of attribute values in the chosen event logs. Process models discovered from reconstructed event logs are characterised by lower variability of allowed behaviour and, therefore, are more usable in practice.

Classification of text based on its substance is an essential part of analysis to organize enormously large text data and to mine the salient information contained in it. It is gaining greater attention with the surge in the volume of on-line data available. Classical algorithms like k-NN (k-nearest neighbor), SVM (Support Vector Machine) and their variations have been observed to yield only reasonable results in addressing the problem, leaving enough room for further improvement. A class of algorithms commonly referred to as Sparse Methods has been emerged recently from compressive sensing and found numerous effective applications in many areas of data analysis and image processing. Sparse Methods as a tool for text analysis is an alley that is largely unexplored rigorously. This paper presents exploration of sparse representation-based methods for text classification. Based on the success of sparse representation based methods in different areas of data analysis, we intuitively hypothesized that it should work well on text classification problems as well. This paper empirically reinforces the hypothesis by testing the method on Reuters and WebKB data sets. The empirical results on Reuters and WebKB benchmark data show that it can outperform classical classification algorithms like SVM and k-NN. It has been observed that obtaining the basis of representation and sparse codes are computationally costly operations affecting the performance of the system. We also propose a class-wise dictionary refinement algorithm and dynamic dictionary selection algorithm to make sparse coding faster. The addition of dictionary refinement to the classification system not only reduces the time taken for sparse coding but also gives improved classification accuracy. The outcomes of the study are empirical verification of sparse representation classifier as a text classification tool and a computationally efficient solution for the bottleneck operation of sparse coding.

Facial image manipulation is a particular instance of digital image tampering, which is done by compositing a region from one facial image into another facial image. Fake images generated by facial image manipulation now spread like wildfire on news websites and social networks, and are considered the greatest threat to press freedom. Previous research relied heavily on handcrafted features to analyze tampered regions which were inefficient and time-consuming. This paper introduces a framework that accurately detects manipulated face image using deep learning approach. The original contributions of this paper include (1) a customized convolutional neural network model for Manipulated Face (MANFA) identification; it contains several convolutional layers that effectively extract features of multi-levels of abstraction from a tampered region. (2) A hybrid framework (HF-MANFA) that uses Adaptive Boosting (AdaBoost) and eXtreme Gradient Boosting (XGBoost) to deal with the imbalanced dataset challenge. (3) A large manipulated face dataset that is manually collected and validated. The results from various experiments proved that proposed models outperformed existing expert and intelligent systems which were usually used for the manipulated face image detection task in terms of area under the curve (AUC), computational complexity, and robustness against imbalanced datasets. As a result, the presented framework will motivate the finding of a more powerful altered face images detection method and encourages the integration of the proposed model in applications that have to deal with manipulated images regularly.

Predictive analytics is an essential capability in business process management to forecast future status and performance of business processes. In this paper, we focus on one particular predictive monitoring task that is solved using classification techniques, i.e. predicting the next event in a case. Several different classifiers have been recently employed in the literature in this task. However, a quantitative benchmark of different classifiers is currently lacking. In this paper, we build such a benchmark by taking into account 20 classifiers from five families, i.e. trees, Bayesian, rule-based, neural and meta classifiers. We employ six real-world process event logs and consider two different sampling approaches, i.e. case and event-based sampling, and three different validation methods in order to acquire a comprehensive evaluation about the classifiers’ performance. According to our benchmark, the classifier most likely to be the overall superior performer is the credal decision tree (C-DT), followed by the other top-4 performers, i.e. random forest, decision tree, dagging ensemble, and nested dichotomies ensemble. We also provide a qualitative discussion of how features of an event log can affect the choice of best classifier.

Machine learning has become a pillar of today’s expert and intelligent systems where a special attention has been drawn to unsupervised methods. Support vector data description is one of the most interesting methods proposed in this context that addresses two main challenges: the absence of ground truth labels and the presence of outliers in data. It is well known that the ultimate problem has a great impact on a system performance since it typically prevents and limits its generalization and hence its failure. Even though the strengths of the Support vector data description method, its application into multi class and large scale context, as computer vision systems, raises bottleneck issues due to its runtime complexity and mono-class context application. We propose, in this paper, an approach inspired from the movement behavior of particle swarm and relies on the use of core set paradigm to overcome the aforementioned drawbacks of Support vector data description method. Indeed, since the proposed method uses some parameters corresponding to kernel function and swarm’s movement formulation, we present and study in this paper some strategies to ensure a dynamic adaptation of these parameters. The main qualities of the proposed method is that it provides a fast scheme for clustering a set of points without neither a prior knowledge on the number of naturally occurring cluster in the data nor an assumption on clusters shapes. A quantitative and comparative performance assessment is carried out over the Berkeley and BuffaloXiph datasets. The results witness the efficiency of the method in terms of both classification accuracy and computational performance. These quantitative assessments reinforce the significance as well as the importance of embedding the proposed method in other intelligent systems application areas.

Extensive research has shown that collaboration has substantial impact on supply chains performance. However, most of previous research has focused on information sharing-based collaboration models that require considerable effort to be implemented, such as information exchange supply chain (IESC). This paper introduces a new efficient collaboration model (IS-OUT) for multi-echelon supply chains. The IS-OUT model relies upon the ordering mechanism of the classical order-up-to policy (OUT). In traditional supply chains (TSC), although OUT replenishment orders include two pieces of information: demand forecast and inventory position balance, they are transferred to upstream echelons as single-quantity orders. In IS-OUT, the order information is transferred to the upstream echelons as two component parts of information to provide better coordination in supply chains. In this paper, the mathematical formulation of IS-OUT is presented, and simulation is adopted to compare the performance of TSC, IS-OUT, and IESC under special conditions and assumptions, considering various performance metrics. Although the results indicate that IESC model offers higher performance mostly than IS-OUT, IS-OUT outperforms or at least is comparable with IESC under a few conditions. Since IS-OUT model is easier to implement than IESC, IS-OUT provides a compromise between extent and information sharing requirements, and performance efficiency. The results should help a decision maker to select the model that optimizes its operating environment.

Smart cruise control (SCC) is one of the representative systems of advanced driver assistance systems (ADAS). Conventional SCC systems have a problem in that they cannot detect a cut-in vehicle in a short distance because the field of view (FOV) of their sensors for detecting vehicles ahead is limited. To solve this problem, this paper proposes a novel method using surround view monitoring (SVM) cameras which can observe the surroundings of a host vehicle without blind spots. To reduce the variation of projected appearance according to the relative position, this paper proposes to exploit multiple virtual camera images (rotational images). In each rotational image, vehicles are detected using a part-based method: tires are detected and then vehicles are detected by combining the tires. Detected tires in multiple rotational images are integrated and tracked in 3D space. Finally, the proposed method determines whether a vehicle has intruded into the cut-in zone based on the position and orientation of the vehicle. The proposed method succeeds to detect vehicle even by a simple method thanks to the rotational image even without any special H/W. The proposed method uses only the sensor adopted in mass-produced vehicles and it is very practical. Moreover, the method can estimate the surrounding vehicle position accurately enough to be used in the braking control system. The performance of the proposed method is evaluated with various driving situations, of which the total length is 447.8 min (43.5 min for the test track and 404.3 min for natural driving). Among 211 cut-in events, 208 events are correctly warned and only 3 false warnings occur. Although the proposed method simultaneously processes the rotational images generated from three SVM cameras (forward, left, and right), the average processing time per frame takes about 58 ms.

The present paper aims to show the necessity of information augmentation to cope with the natural decrease in information content in multi-layered neural networks. It is natural to make an effort to collect as much information as possible, because it is impossible to know which information is necessary or useful before learning. Thus, the present paper tries to force neural networks to form new network configurations to have as much information as possible, contrary to the conventional approach of information reduction, such as many types of regularization. For information augmentation, we use the self-organizing map (SOM), which can over-represent inputs and produce as many similar weights as possible. The method was applied to two data sets: the banknote authentication data set and the character recognition data set. In both experimental results, it was confirmed that redundant and excessive information generation in terms of the excessive number of connection weights was connected with improved generalization.

It is a very challenging and important task to adaptively adjust the scale factor F and the crossover rate Cr for Differential Evolutionary (DE) algorithms. Most recent adaptive techniques were designed to generate parameters randomly based on successful trial values during the previous evolving process, lacking explicit guidelines to generate appropriate values. This paper proposes a novel parameter adaption strategy, which could incorporate promising F and Cr pairs extracted by using Association Rule Mining (ARM) into DE algorithms. First, all successful F and Cr values generated by their original methods are recorded during the whole evolution, resulting in an increasing dataset. Second, we discretize the dataset and extract the most frequent itemset of parameters by using a modified version of the widely used Apriori algorithm. Third, a greedy operator is developed to generate new parameters in the next generation by comparing the presented ARM-based and original-method-based fitness values. The presented technique provides an additional pair of F and Cr values to be evaluated, without replacing existing strategies for the control parameters. The main contribution of this paper is that we propose a novel way, which utilizes information generated during the evolutionary process, to enhance exploration capabilities by adjusting control parameters. Experimental results demonstrate that the proposed ARM-based parameter adaptive strategy is able to enhance performances of some state-of-the-art DE variants. Further, this methodology might be helpful for other control parameters of Evolutionary Algorithms (EA).

Clustering of multi-view data has received increasing attention since it explores multiple views of data sets aiming at improving clustering accuracy. Particle Swarm Optimization (PSO) is a well-known population-based meta-heuristic successfully used in cluster analysis. This paper introduces two hybrid clustering methods for multi-view relational data. These hybrid methods combine PSO and hard clustering algorithms based on multiple dissimilarity matrices. These methods take advantage of the global convergence ability of PSO and the local exploitation of hard clustering algorithms in the position update step, aiming to improve the balance between exploitation and exploration processes. Moreover, the paper provides adapted versions of 11 fitness functions suitable for vector data aiming at dealing with multi-view relational data. Two performance criteria were used to evaluate the clustering quality using the two proposed methods over eleven real-world data sets including image and document data sets. Among new findings, it was observed that the top three fitness functions are Silhouette index, Xu index and Intra-cluster homogeneity. The performance of the proposed algorithms was compared with previous single and multi-view relational clustering algorithms. The results show that the proposed methods significantly outperformed the other algorithms in the majority of cases. The results reinforce the importance of the application of techniques such as PSO-based clustering algorithms in the field of expert systems and machine learning. Such application enhances classification accuracy and cluster compactness. Besides, the proposed algorithms can be useful tools in content-based image retrieval systems, providing good categorizations and automatically learning relevance weights for each cluster of images and sets of views.

Pen and paper-based value stream mapping (VSM) is the established tool for recording processes, identifying waste and deriving recommendations for action. However, today, its application in manufacturing industry requires a high level of effort and is challenging due to product and process complexity, as well as dynamics. To overcome these shortcomings, we are developing a methodology to apply process mining (PM) to internal logistics for a mixed-model assembly line. The methodology combines multidimensional process mining (MDPM) techniques with proven principles of lean production and VSM. Firstly, internal logistics is modelled using existing event data by automatically mapping physical logistics activities (e.g. transport, store). Secondly, to enable PM, the event data is transformed into enriched event logs. Thirdly, the MDPM approach contains (1) a discovery analysis, (2) a performance analysis and (3) a conformance analysis including a reference process classification for each individual part and process. Finally, a waste analysis and strategy for practitioners is designed to identify and prioritise wasteful parts and processes. The methodology has been applied and evaluated in a case study at a German automotive manufacturer. In the case study, we analysed 7500 parts and 15 reference processes. An analysis for each individual part and process has not been available yet. We could both identify part-specific root causes (e.g. a long lead time) and process-specific root causes (e.g. a low trace fitness). The main contribution of this paper is to provide an MDPM methodology for practitioners to enable a continuous recording, evaluation and waste analysis of each individual part and process within internal logistics.

The Rapidly-exploring Random Tree (RRT) algorithm is a popular algorithm in motion planning problems. The optimal RRT (RRT*) is an extended algorithm of RRT, which provides asymptotic optimality. This paper proposes Quick-RRT* (Q-RRT*), a modified RRT* algorithm that generates a better initial solution and converges to the optimal faster than RRT*. Q-RRT* enlarges the set of possible parent vertices by considering not only a set of vertices contained in a hypersphere, as in RRT*, but also their ancestry up to a user-defined parameter, thus, resulting in paths with less cost than those of RRT*. It also applies a similar technique to the rewiring procedure resulting in acceleration of the tendency that near vertices share common parents. Since the algorithm proposed in this paper is a tree extending algorithm, it can be combined with other sampling strategies and graph-pruning algorithms. The effectiveness of Q-RRT* is demonstrated by comparing the algorithm with existing algorithms through numerical simulations. It is also verified that the performance can be further enhanced when combined with other sampling strategies.

Blockchain, the underlying technology of Bitcoin, refers to the public ledger used in a distributed network. Because blockchain does not rely on a central authority, peers have to agree on the state of the ledger among themselves, i.e., they have to reach a consensus on the state of the transactions. The way nodes reach that consensus has gained incredible attention in the literature. Bitcoin uses the Proof-of-Work (PoW) mechanism, as did Ethereum at first. The latter decided to move from PoW to Proof-of-Stake (PoS) because of the high energy consumption required by PoW. To date, many other consensus protocols have been proposed to address the limitations of the seminal ones. In this paper, we inform researchers and practitioners about the current state of consensus protocols research. The aim is to provide an analysis of the research introducing new consensus protocols in order to enable a more unified treatment. To that end, we review 28 new consensus protocols and we propose a four-category classification framework: Origin, Design, Performance and Security. We demonstrate the applicability of the framework by classifying the 28 protocols. Many surveys have already been proposed in the literature and some of them will be discussed later in the paper. Yet, we believe that this work is relevant and important for two reasons. Firstly, blockchain being a fast evolving topic, new consensus protocols emerge regularly and improvements are also put forward on a regular basis. Hence, this work aims at reflecting the latest state-of-the-art in terms of consensus protocols. Secondly, we aim to propose a comprehensive classification framework, integrating knowledge from multiple works in the literature, as well as introducing classification dimensions that have not been proposed before. This work demonstrates that multiple consensus have been proposed in a short period of time, and highlights the differences between these protocols. Furthermore, it is suggested that researchers and practitioners who aim to propose consensus protocols in the future should pay attention to all the dimensions presented in the classification framework.

In this paper we apply a series of Machine Learning models to a recently published unique dataset on the mortality of COVID19 patients. We use a dataset consisting of blood samples of 375 patients admitted to a hospital in the region of Wuhan, China. There are 201 patients who survived hospitalisation and 174 patients who died whilst in hospital. The focus of the paper is not only on seeing which Machine Learning model is able to obtain the absolute highest accuracy but more on the interpretation of what the Machine Learning models provides. We find that age, days in hospital, Lymphocyte and Neutrophils are important and robust predictors when predicting a patients mortality. Furthermore, the algorithms we use allows us to observe the marginal impact of each variable on a case-by-case patient level, which might help practicioneers to easily detect anomalous patterns. This paper analyses the global and local interpretation of the Machine Learning models on patients with COVID19.

Summarization, is to reduce the size of the document while preserving the meaning, is one of the most researched areas among the Natural Language Processing (NLP) community. Summarization techniques, on the basis of whether the exact sentences are considered as they appear in the original text or new sentences are generated using natural language processing techniques, are categorized into extractive and abstractive techniques. Extractive summarization has been a very extensively researched topic and has reached to its maturity stage. Now the research has shifted towards the abstractive summarization. The complexities underlying with the natural language text makes abstractive summarization a difficult and a challenging task. This paper presents a comprehensive review of the various works performed in abstractive summarization field. For this purpose, we have selected the recent papers on this topic from Elsevier, ACM, IEEE, Springer, ACL Anthology, Cornell University Library and Google Scholar. The papers are categorized according to the type of abstractive technique used. The paper lists down the various challenges and discusses the future direction for research in this field. Along with these, we have identified the advantages and disadvantages of various methods used for abstractive summarization. We have also listed down the various tools which have been used or developed by researchers for abstractive summarization. The paper also discusses the evaluation techniques being used for assessing the abstractive summaries.

Construction is a knowledge-intensive industry, in which organizations are known for the delivery of products and services, relying on different types of knowledge. To manage knowledge effectively, various information technology (IT) models and systems have been developed for knowledge management (KM) in the construction industry over the years. As the next generation of IT application in construction, building information modeling (BIM) is increasingly used today to aid KM. Compared to generic IT tools, BIM has some distinctive features, such as parametric modeling, virtual visualization and centralized platform. However, how to apply these features of BIM to better serve KM has not yet been well summarized and analyzed. In this research, 115 papers on IT-based KM and 73 papers on BIM-supported KM are reviewed, based on which an integrated framework is developed to describe the current status and future directions for KM in IT-generic and BIM-specific contexts. It is followed by a conceptual model of BIM-supported KM which shows the possible KM factors and their relationships in the BIM environment. This research highlights the transformation from IT-based KM into BIM-supported KM. It contributes to the identification of remaining challenges to BIM-supported KM and the elaboration of BIM-supported KM in construction research and practice.

People with type 1 diabetes must control their blood glucose level through insulin infusion either with several daily injections or with an insulin pump. However, estimating the required insulin dose is not easy. Recommender systems, mainly based on Case-Based Reasoning (CBR), are being developed to provide recommendations to users. These systems are designed to keep the experiences or cases of the user in a case-base, which requires maintenance to keep system's response accurate and efficient. This paper proposes a case-base maintenance methodology that combines case-base redundancy reduction and attribute weight learning. Contrary to previous approaches designed for classification problems, the maintenance methodology presented in this paper deals with numerical recommendations. It can manage a potentially huge case-base due to the combinatorial derived from the number of attributes used to represent a case. The proposed approach has been tested using the UVA/PADOVA type 1 diabetes simulator and the results demonstrate that it can accomplish better levels of accuracy than other insulin recommender systems mentioned in the literature, when a large number of attributes is considered This project has received funding from the European Union Horizon 2020 research and innovation programme under grant agreement No. 689810, www.pepper.eu.com/, PEPPER, and the grant of the University of Girona 20162018 (MPCUdG2016). The work has been developed with the support of the research group SITES awarded with distinction by the Generalitat de Catalunya (SGR 20142016)

This paper presents a comparative analysis of the outcomes achieved when two widely applied methods for supplier selection—the ‘technique for order of preference by similarity to ideal solution’ (TOPSIS) and ‘data envelopment analysis’—are applied to the problem of identifying the most preferred sustainable suppliers. Both fuzzy DEA and fuzzy TOPSIS are applied to a common dataset of logistics service providers in Sweden. The results reveal that TOPSIS outperforms DEA in terms of both calculation complexity and sensitivity to changes in the number of suppliers. However, output rankings from the two models are found to be less than perfectly correlated. The paper concludes that utilizing both methods, as applied to just a small number of evaluation criteria and a relatively low level of detail in the data, produces a useful pooled shortlist of potential sustainable suppliers. This can then form the basis for a second stage application where either of the methods may be applied to a greater number of criteria that are specified to a higher level of detail. Even more critically, the results also have the potential to point to specific aspects for discussion when negotiating price and service quality commitments with potential sustainable suppliers.

Identification of tumor in medical images is an important task which leads to increased survival chances. In many cases, tumor diagnosis in medical images is very complicated since the pixel intensities between benign and malignant tissues may be very close. The identification problem is defined as the intensification of the mutual data between the image pixel intensities and the desired areas (tumors in this paper), depending on a limitation of the overall size of the desired area borders. This paper introduces a new approach for image segmentation in differentiating between benign and malignant tissues through a nonparametric approach. The proposed approach assumes that the probability densities correlated with pixel intensities in the image for each region are not already known. The image intensity is used instead of using the probability. A nonparametric density estimation is proposed and formulates the theoretical data optimization problem by applying curve evolution methods and deriving the correlated gradient flows. It uses level-set techniques to achieve the resulting evolution. The algorithm is applied to 100 sets of different real data in patient images with benign or/and malignant tissues. The experimental results show that the proposed algorithm proved effective in tumor identification with an acceptable accuracy of 93.1%, especially in-patient images diagnosed with carcinoma at an early stage.

Activation functions play a crucial role in discriminative capabilities of the deep neural networks. They are also one of the main reasons for revival of the neural networks. Although, recent activation functions provide solution to vanishing and exploding gradient problems, but they do not have sufficient capacity to model non-linear data. This paper proposes a novel activation function, which imparts neural networks with capability to model non-linear dependencies in data. Behavior of proposed activation function remains non-saturating even with non-linear structure. The activation function provides distinct activation behaviors to different data range segments. The paper presents two different variants of proposed function. The first, “linear sigmoidal activation” function is a fixed structure activation function with function coefficients defined at the start of model design. Whereas second, “adaptive linear sigmoidal activation” function is a trainable function which can adapt itself according to the complexity of the given data. Both of the proposed models are tested against the state of the art activation functions on benchmark datasets (CIFAR-10, MNIST, SVHN, FER-2013). The proposed activation function is able to outperforms every known activation functions in all the tests.

This paper presents an application of a recently well performing evolutionary algorithm for continuous numerical optimization, Success-History Based Adaptive Differential Evolution Algorithm (SHADE) including Linear population size reduction (L-SHADE), to an expert system for underwater glider path planning (UGPP). The proposed algorithm is compared to other similar algorithms and also to results from literature. The motivation of this work is to provide an alternative to the current glider mission control systems, that are based mostly on multidisciplinary human-expert teams from robotic and oceanographic areas. Initially configured as a decision-support expert system, the natural evolution of the tool is targeting higher autonomy levels. To assess the performance of the applied optimizers, the test functions for UGPP are utilized as defined in literature, which simulate real-life oceanic mission scenarios. Based on these test functions, in this paper, the performance of the proposed application of L-SHADE to UGPP is aggregated using statistical analyis. The depicted fitness convergence graphs, final obtained fitness plots, trajectories drawn, and per-scenario analysis show that the new proposed algorithm yields stable and competitive output trajectories. Over the set of benchmark missions, the newly obtained results with a configured L-SHADE outperforms existing literature results in UGPP and ranks best over the compared algorithms. Moreover, some additional previously applied algorithms have been reconfigured to yield improved performance. Thereby, this new application of evolutionary algorithms to UGPP contributes significantly to the capacity of the decision-makers, when they use the improved UGPP expert system yielding better trajectories.

Deep convolutional models have been able to get extraordinary results in visual, speech and textual processing domains. Nevertheless, the complexity of manifold of images in data space necessitates the deep networks to have a large number of parameters and subsequently these deep models prone to redundancy and overfitting. One of the most effective methods to tackle this problem is devising special regularization methods in the context of convolutional models. In this paper, after presenting and discussing the most important models in the field, sparse feature maps are proposed and employed as a penalty term in the cost function. This conducts the learning process to construct kernels so that the feature maps at every point are sparse along the depth. A sparse representation is able to adapt to the varying level of information of natural images and can help to extract more independent and informative representations. Also, the DropMaps concept is proposed and employed in the last convolutional layer of the model. This technique applies dropout on the feature maps that causes coincidence of feature maps to be avoided. As is shown in this paper, sparse feature maps and DropMaps can handle the problem of overfitting in large models for tiny images. We have studied the effect of the sparsity rate on the accuracy of the model, and it is observed the accuracy of the test dataset reaches its maximum at a sparsity rate of 0.05. Moreover, by designing appropriate learning rate curves, we were able to obtain ensemble machines with much less cost for training. It is noticeable that the test accuracy is higher than the validation accuracy of the ensemble, indicating that the model has not overfitted. In the input of the model, a random online preprocessing layer is employed for the training phase that helps regularization of the model. Comparing input space and feature space of the model we found that the proposed network is able to successfully separate images of different classes. Finally, testing the proposed model with MNIST dataset has shown that the test set can be classified with accuracy 99.75. The same test with CIFAR 10 dataset attained an accuracy of 94.05.

Cross purchase modeling (cross model) is a method to simultaneously analyze multiple product categories for their interrelated influences on consumers’ decisions to purchase each category. Traditional econometric modeling methods are hard to compute and complex in model specifications. This paper examines an artificial neural network (ANN) approach in this context. To understand ANN models’ performance in increasing data scale, this paper uses four datasets of 4, 8, 16 and 32 categories to train ANN models and make predictions. Results show that an ANN model of 12 hidden nodes can be trained in about 3 h and make 88% prediction hit rate for the 16-category dataset. In contrast, a traditional econometric model requires more than 300 h to finish computing for the 16-category dataset. A typical critique of ANN technique is that it hides learned knowledge inside its model structure. This is a major obstacle preventing ANN from being more frequently applied in business research and practices. The current study takes two approaches to address this issue, i.e., (1) customizing ANN components to allow prior knowledge plugging in, and (2) using the generalized weight technique to reveal knowledge that is embedded in ANN training results. Findings of this paper help managers understand applicability of ANN technique in cross purchase model. By demonstrating plugging in prior knowledge to ANN model training and extracting knowledge from ANN training results, this paper shows approaches for understanding ANN embedded knowledge.

Due to the problems presented in current traditional/biometric security systems, the interest to use new security systems, have been increasing. This paper explores the use of brain signals EEG-based during imagined speech in order to use it as a new biometric measure for Subjects identification and thus create a new biometric security system. The main contribution of this paper are two methods for feature extraction, first to improve the signal-to-noise ratio the Common Average Reference was applied. The first method was based on Discrete Wavelet Transform, and the second method was based on statistical features directly from the raw signal. The proposed methods were tested in a dataset of 27 Subjects who performed 33 repetitions of 5 imagined words in Spanish. The results show the feasibility of the task with accurate identification of the Subject, regardless of the imagined word used and using a commercial EEG system (EMOTIV EPOC). In addition, the scope of the method is displayed by decreasing the training data, as well as the number of active sensors for the identification task. Using the proposed method with future improvements and implementing it in a low-cost device can be a new and valuable biometric security system.

In knowledge discovery studies, association rules mining has been extensively studied to discover hidden knowledge and relationships among set of items in a transactional dataset. Most research on association rule mining focuses on discovering frequent patterns based on the most frequent items occurring in the dataset. However, the process of extracting rare rules has received less attention. In medical dataset studies, the discovery of rare association rules (RARs) is more challenging, because it could likely be used to obtain more potentially rare and unusual knowledge for physicians, beside frequent association rules. Hence, the aim of this paper is to discover non-frequent or rare-unusual association rules (RUARs) from a stroke medical dataset to provide potential meaningful knowledge to the user domain. A discretization method needs to be performed as the data preprocessing step before generating rules. To the best of our knowledge, fewer studies have focused on the role of discretization results to support the extraction of a better amount and quality of RUARs, particularly for medical datasets. In addition, the extracted RUARs is expected to provide potential new unusual insights on stroke risk patterns. This paper applies mutual information measure to discretize a stroke examination dataset collected from a medical center in Taiwan. The interval merging method was proposed to simplify the discrete form and enrich the quality of generated rules. Towards the end, rare association rules, with relatively low support, were generated by employing the Apriori-Rare method accordingly. In addition, a filtering process was applied to the content of the rule itemsets to discover the expected set of RUARs for physicians. Furthermore, the extracted RUARs was analyzed based on the relative risk values toward the occurrence of stroke. Results indicated that the mutual information discretization outperformed the traditional discretization methods in terms of how the discretization scheme can support the extraction of RUARs with a better quantity and quality measurements for further analysis purpose in medical point of view. Moreover, the proposed method had a relatively higher number of RUARs. The knowledge of unusual rule patterns from rare association rules might provide potential new and unusual insights for medical pratitioners and increase the awareness of stroke examination results.

Developing effective approaches to design optimal resources of system based on the concepts of benchmark in DEA and optimal design in De-Novo programming is one of the important managerial decision making problems. In this paper, a decision support system is developed for allocation of resources and setting the targets across a set of entities in an equitable manner in presence of uncertainty. The proposed approach has two main modules. First, the most suitable system is designed using De-Novo programming. De-Novo programming. De-Novo programming is used to optimally determine the inputs (i.e., resources) and outputs (i.e., targets) of DMUs in network DEA rather than optimizing existing DMUs. Then, the optimal values of resources are allocated and optimal values of the targets are set in a complex network structure. Furthermore, in real-world problems budget of resources and targets are usually mixed with uncertainties, so in this paper, two concept of fuzzy and interval type-II fuzzy resources and target are developed for resource allocation and target setting. Finally numerical example based on real case of natural gas supply chain is also used to evaluate the applicability and efficacy of the proposed models.

Since 1990, the International Society of Biomechanics (ISB) has made efforts to provide uniformity to motion description. However, the majority of user studies and technological systems that use motion recognition for rehabilitation, such as virtual and augmented reality (VR and AR), do not follows this standard. Typically, VR and AR techniques recognize motion by comparing human joint positions to a pre-recorded movement, direction, or position relative to an interactive object. Aiming to fill a lack of biomechanical reference on joint motion recognition and analysis for rehabilitation interactive systems, this paper proposes a movement description and recognition method following the ISB standard. The developed method aims to provide computational solutions which are clinically relevant and that uses clinical jargon known to the rehabilitation therapists. The proposed method will also allow motion analysis independent of user's height or its position relative to sensor. We conclude this paper by presenting a comparative analysis of the effectiveness of the Kinect sensors (versions 1 & 2) regarding the recognition of patient exercise motions related to the biomechanical standard. Our solution consists of biomechanical motion classification by identifying in which 3D plane the motion occurs. The motion recognition solution also provides patient posture, motion, and information about incorrect exercise performance. The method was developed by first implementing a body representation and Joint Coordinate System based on ISB standard and then motion angle and biomechanical classifications were performed. Specific methods to measure axial rotations were developed inspired by the traditional goniometry strategy. Also, experiments to evaluate if the method is able to classify the biomechanical motions and, thus, detect whether or not they are being performed correctly were performed using both Kinect v1 and Kinect v2. Motions were performed in correctly and wrongly to also verify false positives. Each classified motion was performed 100 times: 70 correct repetitions (35 at normal speed and 35 fast ones) and 30 wrong ones (out of their respective plane). The motion recognition method showed good efficacy in classifying the biomechanical motions correctly. Most of motions presented great success rate of recognition . higher than 80%, mainly using a 20 degrees tolerance.

This paper introduces a new method for calculating distances between matrix sequences of different length. Matrix sequences are often used in spatiotemporal analysis, a field of research combining topological frameworks and temporal reasoning. The Qualitative Trajectory Calculus, a spatiotemporal calculus using matrix sequences, is used as an example in this paper. Since current approaches for comparing sequences are not suitable to calculate distances between matrix sequences of different length, a new method is proposed. The method is based on sequence alignment and uses the Levenshtein distance metric as starting point. The method is presented in general at first, followed by an application to QTC-matrix sequences and a three cushion billiards movement pattern detection example. Possible applications in expert and intelligent systems are discussed, such as human-robot interaction with multiple robots, and automated traffic analysis of (autonomous) vehicle interactions. The proposed method, however, can be applied in a broad range of domains, whenever distances need to be calculated between matrix sequences of different length.

This paper presents a hybrid approach for path planning of multiple mobile robots in continuous environments. For this purpose, first, an innovative Artificial Potential Field (APF) algorithm is presented to find all feasible paths between the start and destination locations in a discrete gridded environment. Next, an enhanced Genetic Algorithm (EGA) is developed to improve the initial paths in continuous space and find the optimal path between start and destination locations. The proposed APF works based on a time-efficient deterministic scheme to find a set of feasible initial paths and is guaranteed to find a feasible path if one exists. The EGA utilizes five customized crossover and mutation operators to improve the initial paths. In this paper, path length, smoothness, and safety are combined to form a multi-objective path planning problem. In addition, the proposed method is extended to deal with multiple mobile robot path planning problem. For this purpose, a new term is added to the objective function which measures the distance between robots and a collision removal operator is added to the EGA to remove possible collision between paths. To assess the efficiency of the proposed algorithm, 12 planar environments with different sizes and complexities were examined. Evaluations showed that the control parameters of the proposed algorithm do not affect the performance of the EGA considerably. Moreover, a comparative study has been made between the proposed algorithm, A*, PRM, B-RRT and Particle Swarm Optimization (PSO). The comparative study showed that the proposed algorithm outperforms PSO as well as well-recognized deterministic (A*) and probabilistic (PRM and B-RRT) path planning algorithms in terms of path length, run time, and success rate. Finally, simulations proved the efficiency of the proposed algorithm for a four-robot path planning problem. In this case, not only the proposed algorithm determined collision-free paths, but also it found near optimal solution for all robots.

Stochastic Gradient Descent (SGD) is one of the most popular first-order methods to solve optimization problems in large-scale, which has also been widely studied in intelligence system, deep neural networks, or machine learning. In this paper we set out to revisit SGD with practical concerns in mind and hope to provide intuition on how SGD should be done in the right way in applications for expert and intelligence systems. In literature, when implementing SGD, regularization is often added to the loss function, to avoid ill-conditioning or overfitting, or to obtain solutions with desirable sparse structure. Intuitively, regularized loss function deviates from the true loss and in this case SGD may lead to a suboptimal solution. In this paper we revisit the matter of l2 regularization for SGD, to investigate whether or when an explicit regularizer is necessary to obtain the desirable performance. We further introduce a simple stochastic algorithm (ASG) using the accumulated stochastic gradient of the un-regularized loss. Then experiments are carried out on benchmark data sets to validate the theoretical analysis. The findings show that for l2 regularization, (1) SGD without explicit regularizing (SGDE) actually possesses an implicit regularizer, and in the sense of upper bound of the convergence rate, it outperforms SGD regularized explicitly (SGDER) with a constant advantage; (2) ASG without explicit regularizing outperforms both SGDE and SGDER, especially in the case where the number of iteration T cannot be pre-specified; (3) for SGD algorithms, the schemes that places flexible weight on the output of the latest iteration can give a better trade-off, compared with the scheme using the output of the last iteration or taking the average of the output of each iteration, and this suggests that in application a tunable averaging scheme is preferable. This study provides insights on using SGD algorithms for big data applications, e.g., to accelerate SVMs or regularized regression in large-scale, or to improve the performance of online learning or real time forecasting (control). In particular, when T is pre-specified, SGDE (without an explicit regularizer) can give us a well enough perforce with simplicity and understandability; when T cannot be pre-specified, ASG can improve the performance of standard SGD algorithms.

In this paper, an extension and an application to the green procurement model based on Coloured Petri Nets is presented. The large number of services and providers for services that can exist in a company means a problem when it comes to managing purchases and much more if the purchases. If the purchases have a benefit such as the sustainability of the companies processes that provide the service, the problem is even greater. This paper aims to develop an extension for this proposed model using the petri nets tools thanks to its ease of modeling complex systems. Likewise, a new algorithm applied to the place of selection of suppliers and a methodical mathematical formalization was developed. Finally, two examples are implemented. The first example allows understanding and applying the model in a simple way. In the second example or study case, be proposed an application in a services company. This example describes the step by step of the evolution of the model and the results obtained by each stage. The application of the final example shows the qualitative advantages of the developed model and the need to apply some technique of quantitative analysis of easy integration to the model that will be defining in a future research.

The learning algorithm for multivariable data analysis (LAMDA) is a learning method to group or classify quantitative and qualitative historical data. LAMDA can be applied for self-learning and directed learning. Considering self-learning, LAMDA groups historical data through the global membership degrees of a sample with respect to a class, considering the contribution of all features for each sample. Such contribution is called marginal adequacy degree (MAD). To mix all MADs, several aggregation functions such as linear and geometrical connectives are used. The aggregation function calculates the global adequacy degree (GAD) of a sample with respect to a class. This procedure avoids assigning the class number as initial parameter due to that LAMDA applies an automatic threshold called non-informative class (NIC) which finds the best assignment of a portion of data to one class. One improvement for the LAMDA algorithm is the use of a full reinforcement operator called Yager–Rybalov Triple Pi, which can reduce the number of classes. However, this kind of solution ignores the degree to which one sample belongs to one class relative to all samples. Another limitation is that the classes reduction is not controlled by a parameter or an algorithm, which removes some classes required by a human expert. Such removed classes can be useful for the human expert in the data analysis of complex processes or for intelligent systems when the searching of additional information is required in decision-making. In this paper, the typicality degree and the intuitionistic fuzzy sets (IFSs) are used to propose one improvement of the LAMDA method in order to develop a strategy that avoids the loss of significant classes. This paper shows two functions: global typicality degree (GTD) and intuitionistic global adequacy degree (IGAD). By integrating both functions, a new function called typicality and intuitionistic global adequacy degree (TIGAD) is proposed. The proposal is applied in three study cases. The results show an improvement of clustering which were validated by the human expert and the information of data. Furthermore, the impact of the research is focused on data analysis, where the expert should make the best decision.

A model of the unequal-area facility layout problem is described.A modified multi-objective particle swarm optimization algorithm is proposed.We apply the heuristic strategy to update layout.The gradient method is applied to execute local search.The objective space division method is used to find the Pbest and Gbest. The facility layout problem (FLP) is the problem of placing facilities in a certain shop floor so that facilities do not overlap each other and are satisfied with some given objectives. Considering practical situations, this study focuses on the multi-objective unequal-area facility layout problem (UA-FLP), where the facilities have unequal-areas and fixed shapes and are placed orthogonally in the continuous shop floor. The objectives of the problem aim to optimize the material handling cost, the total adjacency value and the utilization ratio of the shop floor. The chief difficulties of this version of the FLP lie in the satisfaction of non-overlapping constraint between any two different facilities and the optimization of multiple objectives in the huge solution space. In this paper, we put forward a heuristic configuration mutation operation and subsequent local search based on the gradient method to satisfy the non-overlapping constraint, and the multi-objective particle swarm optimization (MOPSO) algorithm, which has recently proven its high effectiveness and robustness in solving multi-objective problems, to obtain a set of Pareto-optimal solutions of the problem. The novelty of the paper lies in the use of an objective space division method in the MOPSO which governs the neighborhood topology and the local best swarm used to assess the global fitness of a solution and choose the global leader particle. The proposed algorithm is tested on three sets of different UA-FLPs from the literature with the size of the problem up to 62 facilities. The numerical results show that the proposed method is effective in solving the multi-objective UA-FLP.

This paper considers a shared scheduling environment for distributed manufacturing resources. In this paper, we proposed a multi-agent system based approach to promote competition and cooperation among multi-agents and to achieve global optimal scheduling. We first build two multi-agent system (MAS) architectures. One is enterprise multi-agent subsystem (Sub-EMAS) architecture comprises job agents, resource agents and manager agents; the other one is enterprise alliance multi-agent system (EA-MAS) architecture involves the addition of a mediator agent and a scheduling agent. Then we design a Shared Contract Net Protocol (SCNP) to support both the Sub-EMAS and EA-MAS. We propose two heuristic algorithms to solve the scheduling model. The computational experiments show that the EA-MAS, with the integration of shared resource information, is able to provide shared scheduling scheme for distributed manufacturing with a good performance.

This short communication provides a discourse emerged after reading “Stacking ensemble based deep neural networks modeling for effective epileptic seizure detection, Expert Systems with Applications, 148, 113239, 2020.” The discussed paper proposes a novel application of stacking-based ensemble for seizure detection, where several deep neural networks were used as base classifiers. The ensemble design and experimental results presented by the author show some weaknesses, which is indicated by, one of which, an inability of the proposed model to outperform previous studies. In this note, controversy of the discussed paper is explained and an improved version of stacking-based deep neural network is also further introduced and detailed to prevent it in the future.

Bayesian network structure learning is the basis of parameter learning and Bayesian inference. However, it is a NP-hard problem to find the optimal structure of Bayesian networks because the computational complexity increases exponentially with the increasing number of nodes. Hence, numerous algorithms have been proposed to obtain feasible solutions, while almost all of them are of certain limits. In this paper, we adopt a heuristic algorithm to learn the structure of Bayesian networks, and this algorithm can provide a reasonable solution to combine the PC and Particle Swarm Optimization (PSO) algorithms. Moreover, we consider structure priors to improve the performance of our PC-PSO algorithm. Meanwhile, we utilize a new mutation operator called Uniform Mutation by Addition and Deletion (UMAD) and a crossover operator called Uniform Crossover. Experiments on different networks show that the approach proposed in this paper has achieved better Bayesian Information Criterion (BIC) scores than other algorithms.

Advances in neuroimaging techniques have enabled early diagnosis and better understanding of neuro-psychological disorders using resting state - functional Magnetic Resonance Images (rs-fMRI). However, factors like the large intra-class variability, high homogeneity, limited sample size and varied acquisition methodologies in aggregated datasets have limited their classification performance. These issues especially are highly prevalent in the automatic diagnosis of Attention Deficit Hyperactivity Disorder (ADHD). In this paper, a Discriminative Spatial Filtering Method (DSFM) is developed to improve the separability between the two classes in the dataset by automatically identifying regions of the brain with abnormal activities. Further, DSFM uses an orthogonal projection to extract highly separable features from raw rs-fMRI data of the identified regions of the brain. Using a projection based learning classifier DSFM achieved a classification accuracy of 73.83 % on the publicly available ADHD200 dataset. The results show that, selective inclusion of data from the regions of the brain with discriminant activity identified using DSFM removes the redundant features and improved the classification performance (improvement of 3.5 % over baseline). Further, the brain activity maps derived by inverse mapping of the DSFM spatial filters describe the nature of the abnormal brain activities and identify the corresponding regions responsible for the cognitive symptoms in neuro-psychological disorders like ADHD. The results in this paper clearly show that DSFM is a reliable diagnostic tool with interpretable results critical for the accurate understanding the etiological factors of neuro-psychological disorders like ADHD using rs-fMRI.

Music radio data is currently underutilised in radio program management. Software tools that listen to and analyse music airplay are in many markets nonexistent, limited, or unaffordable. In this paper we present a novel knowledge discovery and visualisation framework for broadcast radio, ZeitMetric. The ZeitMetric framework uses machine learning and music information retrieval techniques to label radio audio automatically for knowledge discovery. The framework incorporates a novel music dataset collection technique (MusiGrab) to leverage online music services for ground-truth data, as well as a novel knowledge visualisation and presentation technique based on self-organizing maps (ZeitViz). The framework is compared to what little literature relating to this topic exists, and a set of requirements for a high-quality broadcast radio knowledge discovery is developed. MusiGrab specifically is compared to an existing static music information retrieval dataset and shown to offer superior results in this context. Future research directions using and extending the framework are also discussed. On acceptance of the paper, code for a use-case of the MusiGrab dataset collection technique will be released on GitHub.

Classifying manual and non-manual gestures in sign language recognition is a complex and challenging task. Sign language gestures are the combination of hand, face, and body postures, which often have self-occlusions and inter-object occlusions of both the hands, hands with face, or hands with upper body postures. This paper addresses the characterization of manual and non-manual gestures in recognizing the sign language gestures from continuous video sequences. This paper introduces a novel hyperparameter based optimized Generative Adversarial Networks (H-GANs) to classify the sign gestures, and it works in three phases. In phase-I, it adapts the stacked variational auto-encoders (SVAE) and Principal Component Analysis (PCA) to get the pre-tuned data with reduced feature dimensions. In Phase-II, the H-GANs employed Deep Long Short Term Memory (LSTM) as generator and LSTM with 3D Convolutional Neural Network (3D-CNN) as a discriminator. The generator generates random sequences with noise from the real sequence of frames, and the discriminator detects and classifies the real frames of sign gestures. In Phase-III, the proposed approach employs Deep Reinforcement Learning (DRL) for hyperparameter optimization and regularization. By getting the reward points, Proximal Policy Optimization (PPO) optimizes the hyperparameters, and Bayesian Optimization (BO) regularizes the hyperparameters. The proposed H-GANs used two different large vocabulary sign corpus of continuous sign videos to evaluate the performance and efficiency of the system. The experimental results on different dimensions reveal that the H-GANs improved the accuracy and recognition rate when compared with the state-of-the-art classification methods with reduced complexity.