Search

A taxonomy that classifies ensemble models in the literature is presented.Surface and deep features integration is explored to improve classification.Several ensembles of classifiers and features are proposed and evaluated.Performance of the proposed models is evaluated on several sentiment datasets. Deep learning techniques for Sentiment Analysis have become very popular. They provide automatic feature extraction and both richer representation capabilities and better performance than traditional feature based techniques (i.e., surface methods). Traditional surface approaches are based on complex manually extracted features, and this extraction process is a fundamental question in feature driven methods. These long-established approaches can yield strong baselines, and their predictive capabilities can be used in conjunction with the arising deep learning methods. In this paper we seek to improve the performance of deep learning techniques integrating them with traditional surface approaches based on manually extracted features. The contributions of this paper are sixfold. First, we develop a deep learning based sentiment classifier using a word embeddings model and a linear machine learning algorithm. This classifier serves as a baseline to compare to subsequent results. Second, we propose two ensemble techniques which aggregate our baseline classifier with other surface classifiers widely used in Sentiment Analysis. Third, we also propose two models for combining both surface and deep features to merge information from several sources. Fourth, we introduce a taxonomy for classifying the different models found in the literature, as well as the ones we propose. Fifth, we conduct several experiments to compare the performance of these models with the deep learning baseline. For this, we use seven public datasets that were extracted from the microblogging and movie reviews domain. Finally, as a result, a statistical study confirms that the performance of these proposed models surpasses that of our original baseline on F1-Score.

Present and formally define the Temporal Multi-Agent Resource Allocation diagnosis problem.Propose an efficient solution to this problem by a novel encoding to Boolean Satisfiability (SAT).Demonstrate empirically the scalability of the proposed approach. In the not-so-far future, autonomous vehicles will be ubiquitous and, consequently, need to be coordinated to avoid traffic jams and car accidents. A failure in one or more autonomous vehicles may break this coordination, resulting in reduced efficiency (due to traffic load) or even bodily harm (due to accidents). The challenge we address in this paper is to identify the root cause of such failures. Identifying the faulty vehicles in such cases is crucial in order to know which vehicles to repair to avoid future failures as well as for determining accountability (e.g., for legal purposes). More generally, this paper discusses multi-agent systems (MAS) in which the agents use a shared pool of resources and they coordinate to avoid resource contention by agreeing on a temporal resource allocation. The problem we address, called the Temporal Multi-Agent Resource Allocation (TMARA) diagnosis problem (TMARA-Diag), is to find the root cause of failures in such MAS that are caused by malfunctioning agents that use resources not allocated to them. As in the autonomous vehicles example, such failures may cause the MAS to perform suboptimally or even fail, potentially causing a chain reaction of failures, and we aim to identify the root cause of such failures, i.e., which agents did not follow the planned resource allocation. We show how to formalize TMARA-Diag as a model-based diagnosis problem and how to compile it to a set of logical constraints that can be compiled to Boolean satisfiability (SAT) and solved efficiently with modern SAT solvers. Importantly, the proposed solution does not require the agents to share their actual plans, only the agreed upon temporal resource allocation and the resources used at the time of failure. Such solutions are key in the development and success of intelligent, large, and security-aware MAS.

An anomaly detection algorithm to identify AIS on-off switching is proposed.The algorithm exploits the AIS message Received Signal Strength Indicator.Machine Learning algorithms are used to build normality models.AIS reception is characterized by using real word data.The methodology is scalable from one station to a network of receivers. The Automatic Identification System (AIS) is a ship reporting system based on messages broadcast by vessels carrying an AIS transponder. The recent increase of terrestrial networks and satellite constellations of receivers is making AIS one of the main sources of information for Maritime Situational Awareness activities. Nevertheless, AIS is subject to reliability and manipulation issues; indeed, the received reports can be unintentionally incorrect, jammed or deliberately spoofed. Moreover, the system can be switched off to cover illicit operations, causing the interruption of AIS reception. This paper addresses the problem of detecting whether a shortage of AIS messages represents an alerting situation or not, by exploiting the Received Signal Strength Indicator available at the AIS Base Stations (BS). In designing such an anomaly detector, the electromagnetic propagation conditions that characterize the channel between ship AIS transponders and BS have to be taken into consideration. The first part of this work is thus focused on the experimental investigation and characterisation of coverage patterns extracted from the real historical AIS data. In addition, the paper proposes an anomaly detection algorithm to identify intentional AIS on-off switching. The presented methodology is then illustrated and assessed on a real-world dataset.

A new initialization technique is proposed to improve the performance of K-means.A data transformation approach is proposed to solve empty cluster problem.An efficient method is proposed to estimate the optimal number of clusters.Proposed clustering method provides more accurate clustering results. Clustering provides a knowledge acquisition method for intelligent systems. This paper proposes a novel data-clustering algorithm, by combining a new initialization technique, K-means algorithm and a new gradual data transformation approach to provide more accurate clustering results than the K-means algorithm and its variants by increasing the clusters coherence. The proposed data transformation approach solves the problem of generating empty clusters, which frequently occurs for other clustering algorithms. An efficient method based on the principal component transformation and a modified silhouette algorithm is also proposed in this paper to determine the number of clusters. Several different data sets are used to evaluate the efficacy of the proposed method to deal with the empty cluster generation problem and its accuracy and computational performance in comparison with other K-means based initialization techniques and clustering methods. The developed estimation method for determining the number of clusters is also evaluated and compared with other estimation algorithms. Significances of the proposed method include addressing the limitations of the K-means based clustering and improving the accuracy of clustering as an important method in the field of data mining and expert systems. Application of the proposed method for the knowledge acquisition in time series data such as wind, solar, electric load and stock market provides a pre-processing tool to select the most appropriate data to feed in neural networks or other estimators in use for forecasting such time series. In addition, utilization of the knowledge discovered by the proposed K-means clustering to develop rule based expert systems is one of the main impacts of the proposed method.

The identification and prediction of situations in smart houses.An approach developed with the principles of reactive and proactive behavior.A case study presented with sensors and appliances.The proactivity and reasoning about uncertainty supported by probabilistic ontology. Considering that the world population is aging, health-support issues are in evidence, and many dangerous situations concerning users in their living environment may arise. This paper presents an approach to allow Ambient Assisted Living (AAL) systems to identify and predict situations that may endanger users in their living environment. Elderly people generally have difficulties to perform daily activities as using some electronic device, cooking, dressing among others. This paper offers an alternative to acquire comprehension of a former person's behavioral providing this knowledge when cognitive impairments will occur. This is a significant improvement to traditional expert systems applied to AAL as the handling of the knowledge base is adapted to the failing users behavior. We consider the user profile dynamics where new and different situations not initially planned in the development of the systems may occur. This approach was developed considering the principles of reactive and proactive behavior and the extensibility capacity of the system. Systems developed following the above-described principles can react to the current situations and anticipate proactively a dangerous situation eliminating it or controlling its impact. The approach is evaluated and verified by a case study where unwanted, dangerous situations were created and subsequently detected. The case study is based on a simulated smart house fulfilled with sensors and appliances. An application was build based on the developed approach, and it was capable of choosing the most appropriate actions to solve the unwanted situations. The main contributions of the present work are the identification and prediction of situations in smart houses, an approach developed with the principles of reactive and proactive behavior validated with a case study and supported by a probabilistic ontology.

527 articles related to imbalanced data and rare events are reviewed.Viewing reviewed papers from both technical and practical perspectives.Summarizing existing methods and corresponding statistics by a new taxonomy idea.Categorizing 162 application papers into 13 domains and giving introduction.Some opening questions are discussed at the end of this manuscript. Rare events, especially those that could potentially negatively impact society, often require humans decision-making responses. Detecting rare events can be viewed as a prediction task in data mining and machine learning communities. As these events are rarely observed in daily life, the prediction task suffers from a lack of balanced data. In this paper, we provide an in depth review of rare event detection from an imbalanced learning perspective. Five hundred and seventeen related papers that have been published in the past decade were collected for the study. The initial statistics suggested that rare events detection and imbalanced learning are concerned across a wide range of research areas from management science to engineering. We reviewed all collected papers from both a technical and a practical point of view. Modeling methods discussed include techniques such as data preprocessing, classification algorithms and model evaluation. For applications, we first provide a comprehensive taxonomy of the existing application domains of imbalanced learning, and then we detail the applications for each category. Finally, some suggestions from the reviewed papers are incorporated with our experiences and judgments to offer further research directions for the imbalanced learning and rare event detection fields.

A novel approach is provided to specify and verify service compositions contracts.BPEL is extended to represent specifications and mark the points to be verified.Properties are derived automatically from composition implementations.The verification process relies on commitment logic and its model checking.Web services are verified from the perspectives of compliance and violations. The paper proposes a novel model checking-based approach towards verifying the compliance of intelligent agent-based web services with contracts regulating their compositions specified in the Business Process Execution Language (BPEL). Unlike the existing approaches in the literature, the main contribution and impact of the introduced approach is the ability to verify intelligent and autonomous composite web services by capturing and describing in details both compliance and violation behaviors, how the system can distinguish between them, and how the system reacts and can be recovered after each violation. The approach encompasses three contributing parts, namely: 1) the marking process of an extended BPEL; 2) the transformation of the extended and marked BPEL to an automata model; and 3) the encoding of the resulting automata model into the Interpreted Systems Programming Language (ISPL), the input language of the MCMAS model checker for intelligent and autonomous multi-agent systems. In the first part, we extend BPEL that specifies the business process of the composition by creating custom activities called labels. We use those labels as means to represent the specifications and mark the points the developer aims to verify. A significant advantage of this labeling is the ability to highlight specific points in the design to be verified and to distinguish compliance behaviors from violations, which makes this verification focused and highly efficient. In the second part, we introduce new transformation rules to transform the extended and marked BPEL to an automata model. This transformation requires a prior modeling of agent-based web services composition using automata definitions. In the third part, we introduce algorithmic translation rules encoding the resulting automata model into ISPL. This translation makes model checking the behavior of our contract-driven compositions possible. A novel characteristic of the proposed approach is the automatic generation of the properties against which the system is verified from the composition's implementation, which is technically challenging. The verification properties are expressed in the Computation Tree Logic of Commitments (CTLC). Technically, CTLC provides a powerful representation to formally model 1) interactions among multi-agent based web services and 2) compliance and violation behaviors within composite business contracts by making use of communicative commitment operators. CTLC also includes a fulfillment operator which helps formally check the compliance with business contracts and specify the system recovery. A detailed case study from expert and intelligent systems domain along with experimental results are also reported in the paper. Finally, the main impact and significance of the paper on expert and intelligent systems is the ability to use these systems safely since there is a way to verify if the intelligent components behave according to and in compliance with the underlying regulating contracts.

SAM provides enhanced visual aids for representing the many-to-many association rules in large transaction data.The performance of SAM can be numerically evaluated by using S2C measure.SAM enables users to conveniently identify the interesting areas that might contain interesting association rules.SAMs with higher S2C values are more useful for visual exploration of association rules. The association rule mining is one of the most popular data mining techniques, however, the users often experience difficulties in interpreting and exploiting the association rules extracted from large transaction data with high dimensionality. The primary reasons for such difficulties are two-folds. Firstly, too many association rules can be produced by the conventional association rule mining algorithms, and secondly, some association rules can be partly overlapped. This problem can be addressed if the user can select the relevant items to be used in association rule mining, however, there are often quite complex relations among the items in large transaction data. In this context, this paper aims to propose a novel visual exploration tool, structured association map (SAM), which enables the users to find the group of the relevant items in a visual way. The appearance of SAM is similar with the well-known cluster heat map, however, the items in SAM are sorted in more intelligent way so that the users can easily find the interesting area formed by a set of associated items, which are likely to constitute interesting many-to-many association rules. Moreover, this paper introduces an index called S2C, designed to evaluate the quality of SAM, and explains the SAM based association analysis procedure in a comprehensive manner. For illustration, this procedure is applied to a mass health examination result data set, and the experiment results demonstrate that SAM with high S2C value helps to reduce the complexities of association analysis significantly and it enables to focus on the specific region of the search space of association rule mining while avoiding the irrelevant association rules.

A theorem characterizing the property of the optimal solution is presented.A hybrid evolutionary algorithm (HEA) is proposed.Extreme machine learning is used to approximate the fitness of most individuals.Two heuristics are incorporated to generate a good initial population.The proposed algorithm is computationally effective. This paper considers the two-stage capacitated facility location problem (TSCFLP) in which products manufactured in plants are delivered to customers via storage depots. Customer demands are satisfied subject to limited plant production and limited depot storage capacity. The objective is to determine the locations of plants and depots in order to minimize the total cost including the fixed cost and transportation cost. However, the problem is known to be NP-hard. A practicable exact algorithm is impossible to be developed. In order to solve large-sized problems encountered in the practical decision process, an efficient alternative approximate method becomes more valuable. This paper aims to propose a hybrid evolutionary algorithm framework with machine learning fitness approximation for delivering better solutions in a reasonable amount of computational time. In our study, genetic operators are adopted to perform the search process and a local search strategy is used to refine the best solution found in the population. To avoid the expensive consumption of computational time during the fitness evaluating process, the framework uses extreme machine learning to approximate the fitness of most individuals. Moreover, two heuristics based on the characteristics of the problem is incorporated to generate a good initial population. Computational experiments are performed on two sets of test instances from the recent literature. The performance of the proposed algorithm is evaluated and analyzed. Compared with other algorithms in the literature, the proposed algorithm can find the optimal or near-optimal solutions in a reasonable amount of computational time. By employing the proposed algorithm, facilities can be positioned more efficiently, which means the fixed cost and the transportation cost can be decreased significantly, and organizations can enhance competitiveness by using the optimized facility location scheme.

The uncertain quantity of drugs for patients in home health care service is considered.A fuzzy chance constraint programming for vehicle scheduling problem is proposed.A hybrid genetic algorithm integrated with stochastic simulation method is designed.3 series of experiments are conducted to test the efficiency of the algorithm.Cost changes for difference value of Dispatcher Preference Index are discussed. Home Health Care (HHC) companies are widespread in European countries, and aim to serve patients at home to help them recover from illness and injury in a personal environment. Since transportation costs are among the biggest sources of expenditure in company activities, it is of great significance to optimize this in the Home Health Care industry. From the perspective of optimizing the cost of transportation, this paper studies the Vehicle Routing Scheduling problem as it applies to HHC companies. According to a survey of the HHC companies, during the process of delivering medication drugs, the quantity of drugs required for each patient is non-deterministic when the company makes planned routes. This paper considers uncertain demand as a fuzzy variable, which is closer to a potential real life scenario. A Home Health Care Scheduling Problem with fuzzy demand is considered and a fuzzy chance constraint model is designed. We propose a hybrid genetic algorithm integrated with stochastic simulation methods to solve the proposed model. Firstly, the problem is reduced to the classical vehicle routing problem within a time window. Experimental results for Solomons and Hombergers benchmark instances show that the proposed algorithm performs efficiently. Then other experiments on the fuzzy version model are undertaken with the variable value of the Dispatcher Preference Index (DPI) parameter between [0, 1]. Finally, the influence of DPI on the final objective and the indicators of the problem are discussed using stochastic simulation, and the best value of DPI is obtained. This research will help HHC companies to make appropriate decisions when arranging their vehicle scheduling routes.

Automatic generation of user interfaces from domain knowledge: ARBUI.Practical implementation of the proposed architecture (ARBUI): the Semantic MVC.Tested our approach in a pilot project at the Oncology Center in Warsaw. Motivation: The ability to directly trace how requirements are implemented in a software system is crucial in domains that require a high level of trust (e.g. medicine, law, crisis management). This paper describes an approach that allows a high level of traceability to be achieved with model-driven engineering supported by automated reasoning. The paper gives an introduction to the novel, automated user interface synthesis in which a set of requirements is automatically translated into a working application. It is presented as a generalization of the current state of the art model-driven approaches both from the conceptual perspective as well as the concrete implementation is discussed together with its advantages like the alignment of business logic with the application and ease of adaptability. It also presents how a high level of traceability can be obtained if runtime support of automated reasoning over models is applied.Results: We have defined the Automated Reasoning-Based User Interface (ARBUI) approach and implemented a framework for application programming that follows our definition. The framework, called Semantic MVC, is based on model-driven engineering principles enhanced with W3C standards for the semantic web. We will present the general architecture and main ideas underlying our approach and framework. Finally, we will present a practical application of the Semantic MVC that we created in the medical domain as a Clinical Decision Support System for GIST cancer in cooperation with the Maria Sklodowska-Curie Memorial Cancer Center and Institute of Oncology in Warsaw. The discussed expert system allows the expert to directly modify the executable knowledge on the fly, making the overall system cost effective.

Novel fuzzy rule-based system (FRBS) for medical data classification tasks is proposed.FRBSs are designed using multi-objective evolutionary optimization algorithms.Set of FRBSs with various levels of accuracy-interpretability trade-off is generated.Benchmark medical data sets are used to evaluate the effectiveness of the system.Highly interpretable and accurate medical decision support is provided by our approach. In medical decision support systems, both the accuracy (i.e., the ability to adequately represent the decision making processes) as well as the transparency and interpretability (i.e., the ability to provide a domain user with compact and understandable explanation and justification of the proposed decisions) play essential roles. This paper presents an approach for automatic design of fuzzy rule-based classification systems (FRBCSs) from medical data using multi-objective evolutionary optimization algorithms (MOEOAs). Our approach generates, in a single run, a collection of solutions (medical FRBCSs) characterized by various levels of accuracy-interpretability trade-off. We propose a new complexity-related interpretability measure and we address the semantics-related interpretability issue by means of efficient implementation of the so-called strong fuzzy partitions of attribute domains. We also introduce a special-coding-free representation of the rule base and original genetic operators for its processing as well as we implement our ideas in the context of well-known and one of the presently most advanced MOEOAs, i.e., Non-dominated Sorting Genetic Algorithm II (NSGA-II). An important part of the paper is devoted to a broad comparative analysis of our approach and as many as 26 alternative techniques arranged in 32 experimental set-ups and applied to three well-known benchmark medical data sets (Breast Cancer Wisconsin (Original), Pima Indians Diabetes, and Heart Disease (Cleveland)) available from the UCI repository of machine learning databases (http://archive.ics.uci.edu/ml). A number of useful in medical applications performance measures including accuracy, sensitivity, specificity, and several interpretability measures are employed. The results of such a broad comparative analysis demonstrate that our approach significantly outperforms the alternative methods in terms of the interpretability of the obtained FRBCSs while remaining either competitive or superior in terms of their accuracy. It is worth stressing that the overwhelming majority of the existing medical classification methods concentrate almost exclusively on the accuracy issues.

Multi-criteria decision support for eco-friendly routing solutions.Emission minimization and reverse logistics.Efficient unification of multi-objective and multi-attribute VRPs.Efficient handling of non-uniform traffic conditions.Demonstrated utility in real-world VRP manifestations. In this paper, we present a multi-objective shortest path evolutionary algorithm for comprehensive solutions to real-world manifestations of the classical vehicle routing problem. The shift from being a purely academic pursuit is highlighted by the introduction of a generic optimization framework which accommodates a variety of attributes that commonly occur in industrial applications. Specifically, the paper's main contribution are as follows: (1) consideration for the following real-world constraints: (a) time windows at customer locations, (b) simultaneous pickup and delivery demands, (c) a heterogeneous fleet of vehicles, and (d) the heterogeneity of traffic congestion levels in urban transportation networks; (2) assimilation of all the above attributes into a multi-objective program which aims to minimize environmental impact, while simultaneously addressing the overall operational costs of the routing solution and service quality concerns; a feat that has not been fully realized by known intelligent systems according to the authors' best knowledge. In order to showcase the efficacy of the proposed algorithm, it is first tested on existing benchmark instances and then applied on a pair of real-world industrial examples from Singapore. These industrial examples serve as a source of new benchmarks which facilitate the study of different routing constraints and their effects on the economic and environmental viability of urban logistics systems.

Random forests are grown on convolutional neural networks for scene categorization.Features from multi-layers of deep convolutional neural networks are utilized.A feature selection method is proposed to use random forests to categorize scenes. Breakthrough performances have been achieved in computer vision by utilizing deep neural networks. In this paper we propose to use random forest to classify image representations obtained by concatenating multiple layers of learned features of deep convolutional neural networks for scene classification. Specifically, we first use deep convolutional neural networks pre-trained on the large-scale image database Places to extract features from scene images. Then, we concatenate multiple layers of features of the deep neural networks as image representations. After that, we use random forest as the classifier for scene classification. Moreover, to reduce feature redundancy in image representations we derived a novel feature selection method for selecting features that are suitable for random forest classification. Extensive experiments are conducted on two benchmark datasets, i.e. MIT-Indoor and UIUC-Sports. Obtained results demonstrated the effectiveness of the proposed method. The contributions of the paper are as follows. First, by extracting multiple layers of deep neural networks, we can explore more information of image contents for determining their categories. Second, we proposed a novel feature selection method that can be used to reduce redundancy in features obtained by deep neural networks for classification based on random forest. In particular, since deep learning methods can be used to augment expert systems by having the systems essentially training themselves, and the proposed framework is general, which can be easily extended to other intelligent systems that utilize deep learning methods, the proposed method provide a potential way for improving performances of other expert and intelligent systems.

Scientific stakeholders identifications using mobile agents.Tool for improving HR efficiency.Most influential (cited) researcher detection using a relationship graph.Distributed frameworks on top of JADE.Inference rules used in the process. In the business process of reengineering, one of the main problems consists in the organizational reintegration of the employee. New instruments for the automatic identification of stakeholders among existing staff evaluation are needed. It is difficult to identify a stakeholder, especially if we refer to science stakeholders, and the proper evaluation of a researcher's value and position at international level is needed. There are large contradictions concerning the validity of various types of indexing services and other techniques used to classify the researchers. This paper proposes the use of corporate Human Resource Management (HRM) specific instruments when it comes to the researcher as informational stakeholder identification. The main idea behind the method is to use some form of information retrieval techniques over a set of research papers which contain, mostly, the same key words and to extract the hierarchy of the researchers involved/referenced over that set. A distributed approach was used due to its inherent scalability. The use of an inference engine was also deemed necessary due to the complexity of the problem. The system may be used in the automatic assessment of research performance in public or private institutions. It can be easily modified to support complex sets of rules depending on each user's needs in personnel evaluation. The main research field of this papers concerns distributed artificial intelligence.

The work proposes an Event Popularity Algorithm for Financial Trading.The approach is based on sentiment analysis to the social network Twitter.Planning and performing a financial community for the extraction of analyzed tweets.The events are focused on the thirty companies that compose the Dow Jones index. The growing number of Twitter users makes it a valuable source of information to study what is happening right now. Users often use Twitter to report real-life events. Here we are only interested in following the financial community. This paper focuses on detecting events popularity through sentiment analysis of tweets published by the financial community on the Twitter universe. The detection of events popularity on Twitter makes this a non-trivial task due to noisy content that often are the tweets. This work aims to filter out all the noisy tweets in order to analyze only the tweets that influence the financial market, more specifically the thirty companies that compose the Dow Jones Average. To perform these tasks, in this paper it is proposed a methodology that starts from the financial community of Twitter and then filters the collected tweets, makes the sentiment analysis of the tweets and finally detects the important events in the life of companies.

A practical solution of a ships safe trajectory planning problem is proposed.A deterministic method utilizing a concept of a database of trajectories.The method considers COLREGs, ships dynamic properties, static and dynamic obstacles.The algorithm has short computational time and returns optimal solutions.The method is applicable in commercial systems due to simplicity and efficiency. The paper introduces a Decision Support System for ships, developed to solve a problem of collision avoidance with static and dynamic obstacles. The system maps the decision making capability of a human (navigation) expert to solve the path planning problem for a ship in a complex navigation environment. It can be further developed to provide automatic control of a ship. It utilizes a new, fast and effective, deterministic method, called the Trajectory Base Algorithm, to calculate a safe, optimal path for a ship. The system structure, a detailed explanation of a new method, followed by results of simulation tests are all presented in the paper. The results proof a successful application of the method to solve a path planning problem for ships with the consideration of both static and dynamic obstacles in the environment, marine traffic regulations and dynamic properties of a ship, what makes this approach applicable in commercial systems. The approach can also be adapted for application in mobile robots path planning. The experimental results and ability of the system to achieve a new functionality of full autonomy show significance of this contribution to the development of Expert and Intelligent Systems domain. The author believes that autonomous systems constitute the future of Expert and Intelligent Systems.

Focus is on computational intelligence methods in prostate cancer predictive modeling.We survey metaheuristic optimisation methods.We review machine learning methods.We consider cancer data of different modalities.We discuss recent advances, challenges and provide future directions. Predictive modeling in medicine involves the development of computational models which are capable of analysing large amounts of data in order to predict healthcare outcomes for individual patients. Computational intelligence approaches are suitable when the data to be modelled are too complex for conventional statistical techniques to process quickly and efficiently. These advanced approaches are based on mathematical models that have been especially developed for dealing with the uncertainty and imprecision which is typically found in clinical and biological datasets. This paper provides a survey of recent work on computational intelligence approaches that have been applied to prostate cancer predictive modeling, and considers the challenges which need to be addressed. In particular, the paper considers a broad definition of computational intelligence which includes metaheuristic optimisation algorithms (also known as nature inspired algorithms), Artificial Neural Networks, Deep Learning, Fuzzy based approaches, and hybrids of these, as well as Bayesian based approaches, and Markov models. Metaheuristic optimisation approaches, such as the Ant Colony Optimisation, Particle Swarm Optimisation, and Artificial Immune Network have been utilised for optimising the performance of prostate cancer predictive models, and the suitability of these approaches are discussed.

We propose an approach for selecting appropriate defuzzification methods that fulfills the requirements of a group of experts.We propose a sensitivity analysis of defuzzification methods.We apply this approach to the assessment of dam performance.Methods were chosen in relation to the objectives (decision-support and communication) defined by a group of dam experts.The approach is applied to a real case. The performance assessment of dams is of major importance for optimizing maintenance management. A methodology is provided here to assess the risk of dam failure using data collected during in-situ inspections and from the design and follow-up files. This assessment takes into account uncertainty associated with the data and the assessment process. The result of this assessment is introduced in a fuzzy frame. This paper presents the approach taken to choose defuzzification methods that allow extracting the information necessary from this possibility distribution so that dam experts can both rank dam maintenance actions and communicate the results of this assessment.This paper first presents the process used to assess dam performance after which it presents the defuzzification methods available. A sensitivity analysis is then performed to select the methods most relevant for our case study. The last part presents the development of a tool useful for the application of defuzzification methods to our problematic and describes a real case study in which the selected defuzzification methods are used.

Four methods are developed for data mining discrete multi-objective optimization datasets.Two of the methods are unsupervised, one is supervised and the other is hybrid.Knowledge is represented as patterns in one method, and as rules in other methods.Methods are applied to three real-world production system optimization problems.Extracted knowledge is compared across methods and provides new insights. The first part of this paper served as a comprehensive survey of data mining methods that have been used to extract knowledge from solutions generated during multi-objective optimization. The current paper addresses three major shortcomings of existing methods, namely, lack of interactiveness in the objective space, inability to handle discrete variables and inability to generate explicit knowledge. Four data mining methods are developed that can discover knowledge in the decision space and visualize it in the objective space. These methods are (i) sequential pattern mining, (ii) clustering-based classification trees, (iii) hybrid learning, and (iv) flexible pattern mining. Each method uses a unique learning strategy to generate explicit knowledge in the form of patterns, decision rules and unsupervised rules. The methods are also capable of taking the decision makers preferences into account to generate knowledge unique to preferred regions of the objective space. Three realistic production systems involving different types of discrete variables are chosen as application studies. A multi-objective optimization problem is formulated for each system and solved using NSGA-II to generate the optimization datasets. Next, all four methods are applied to each dataset. In each application, the methods discover similar knowledge for specified regions of the objective space. Overall, the unsupervised rules generated by flexible pattern mining are found to be the most consistent, whereas the supervised rules from classification trees are the most sensitive to user-preferences.

We are concerned with an unequal area facility layout problem.This paper is the first work to investigate the use of PGAs for solving the UA-FLP.We present a novel island model genetic algorithm for the UA-FLP.Our novel approach has been tested with a set of well-known problems. The Unequal Area Facility Layout Problem (UA-FLP) has been addressed by various methods, including mathematical modelling, heuristic and metaheuristic approaches. Nevertheless, each type of approach presents problems such as premature convergence, lack of diversity, or high computational cost. In this paper, for the first time, an Island Model Genetic Algorithm (IMGA) is proposed to solve these subjects in the UA-FLP. The parallel evolution of several populations is used to maintain the population diversity and to obtain a wider sampling of the search space to obtain better quality solutions in fewer generations. Our novel approach was tested with a well-known set of problems taken from the literature and the results were compared with those of previous reports. In most cases, the results obtained by our novel approach improved on the previous results. Additionally, the proposed approach is able to reach good solutions with a wide range of problem sizes and in a reasonable computational time.

In this research UCI Indian Liver Patient Dataset (ILPD) used.Boosted C5.0 and CHAID algorithms are used to identify liver disease risk factors.This research shows females have more chance of liver disease than males.Common risk factors of liver disease were extracted by data mining.This research produced quite simple rules. The human liver is one of the major organs in the body and liver disease can cause many problems in human life. Fast and accurate prediction of liver disease allows early and effective treatments. In this regard, various data mining techniques help in better prediction of this disease. Because of the importance of liver disease and increase the number of people who suffer from this disease, we studied on liver disease through using two well-known methods in data mining area.In this paper, novel decision tree based algorithms is used which leads to considering more factors in general and predictions with high accuracy compared to other studies in liver disease. In this application, 583 UCI instances of liver disease dataset from the UCI repository are considered. This dataset consists of 416 records of liver disease and 167 records of healthy liver. This dataset is analyzed by two algorithms named Boosted C5.0 and CHAID algorithms. Until now there is no work in the literature that uses boosted C5.0 and CHAID for creating the rules in liver disease. Our results show that in both algorithms, the DB, ALB, SGPT, TB and A/G factors have a significant impact on predicting liver disease which according to the rules generated by both algorithms important ranges are DB=10.900-1.200, ALB 4.00-4.300, SGPT=34-37, TB=0.600-1.200 (by boosted C5.0), A/G=1.180-1.390, as well as in the Boosted C5.0 algorithm, Alkphos, SGOT and Age have significant impact in prediction of liver disease. By comparing the performance of these algorithms, it becomes clear that C5.0 algorithm via Boosting technique has an accuracy of 93.75% and this result reveals that it has a better performance than the CHAID algorithm which is 65.00%. Another important achievement of this paper is about the ability of both algorithms to produce rules in one class for liver disease. The results of our assessment show that Boosted C5.0 and CHAID algorithms are capable to produce rules for liver disease. Our results also show that boosted C5.0 considers the gender in liver disease, a factor which is missing in many other studies. Meanwhile, using the rules generated in boosted C5.0 algorithm, we obtained the important result about low susceptibility of female to liver disease than male. This factor is missing in other studies of liver disease. Therefore, our proposed computer-aided diagnostic methods as an expert and intelligent system have impressive impact on liver disease detection. Based on obtained results, we observed that our model had better performance compared to existing methods in the literature.

User interactions are used to build contextual recommendation system.A Trace-Based Reasoning process is applied to retrieve and adapt similar episodes.An evaluation protocol measures the performance, accuracy and user satisfaction.Similarity measures are used to compare between interaction traces.The Scenario example is a specific video composition application called Wanaclip. Nowadays, many recent applications retain traces of their usage by collecting user information. These traces help to understand user behavior and activities thus reflect the context. This paper describes how interaction traces allow the building of contextual recommendations using a Trace-Based Reasoning approach. Trace-Based Reasoning is an artificial intelligence paradigm that draws its inspiration from Case-Based Reasoning. In TBR, modeled traces act as the main knowledge container. The application considered in this paper, Wanaclip, is an interactive online video clip composition application. We added a recommendation system that guides users in both video creation and selection. The recommendation engine is fueled by interaction traces provided by previous users and is stored in T Store, a Trace Base Management System that handles the storage, processing and exploitation of traces. This approach uses similarity measures for finding and comparing episodes of traces. We validate our approach by proposing a variation to the classical accuracy definition, which we call "acceptance rate". Our evaluations show that this approach offers satisfactory results in term of recommendations and response time.

Chaotic PSO algorithm is proposed to solve NP-hard IPPS problem.Ten chaotic maps are implemented to avoid premature convergence to local optimum.Makespan, balanced level of machine utilization and mean flow time are observed.Five experimental studies show that cPSO outperforms GA, SA, and hybrid algorithm.Scheduling plans are tested by mobile robot within a laboratory environment. Process planning and scheduling are two of the most important manufacturing functions traditionally performed separately and sequentially. These functions being complementary and interrelated, their integration is essential for the optimal utilization of manufacturing resources. Such integration is also significant for improving the performance of the modern manufacturing system. A variety of alternative manufacturing resources (machine tools, cutting tools, tool access directions, etc.) causes integrated process planning and scheduling (IPPS) problem to be strongly NP-hard (non deterministic polynomial) in terms of combinatorial optimization. Therefore, an optimal solution for the problem is searched in a vast search space. In order to explore the search space comprehensively and avoid being trapped into local optima, this paper focuses on using the method based on the particle swarm optimization algorithm and chaos theory (cPSO). The initial solutions for the IPPS problem are presented in the form of the particles of cPSO algorithm. The particle encoding/decoding scheme is also proposed in this paper. Flexible process and scheduling plans are presented using AND/OR network and five flexibility types: machine, tool, tool access direction (TAD), process, and sequence flexibility. Optimal process plans are obtained by multi-objective optimization of production time and production cost. On the other hand, optimal scheduling plans are generated based on three objective functions: makespan, balanced level of machine utilization, and mean flow time. The proposed cPSO algorithm is implemented in Matlab environment and verified extensively using five experimental studies. The experimental results show that the proposed algorithm outperforms genetic algorithm (GA), simulated annealing (SA) based approach, and hybrid algorithm. Moreover, the scheduling plans obtained by the proposed methodology are additionally tested by Khepera II mobile robot using a laboratory model of manufacturing environment.

The adaptive rule-based classifier is used to classify multi-class biological data.It applies random subspace and boosting approaches with ensemble of decision trees.Decision tree induction is used for evolving rules from the biological data.k-nearest-neighbor is used for removing ambiguity between the contradictory rules.The classifier is evaluated using 148 Exome data sets and 10 life sciences data sets. In this paper, we introduce a new adaptive rule-based classifier for multi-class classification of biological data, where several problems of classifying biological data are addressed: overfitting, noisy instances and class-imbalance data. It is well known that rules are interesting way for representing data in a human interpretable way. The proposed rule-based classifier combines the random subspace and boosting approaches with ensemble of decision trees to construct a set of classification rules without involving global optimisation. The classifier considers random subspace approach to avoid overfitting, boosting approach for classifying noisy instances and ensemble of decision trees to deal with class-imbalance problem. The classifier uses two popular classification techniques: decision tree and k-nearest-neighbor algorithms. Decision trees are used for evolving classification rules from the training data, while k-nearest-neighbor is used for analysing the misclassified instances and removing vagueness between the contradictory rules. It considers a series of k iterations to develop a set of classification rules from the training data and pays more attention to the misclassified instances in the next iteration by giving it a boosting flavour. This paper particularly focuses to come up with an optimal ensemble classifier that will help for improving the prediction accuracy of DNA variant identification and classification task. The performance of proposed classifier is tested with compared to well-approved existing machine learning and data mining algorithms on genomic data (148 Exome data sets) of Brugada syndrome and 10 real benchmark life sciences data sets from the UCI (University of California, Irvine) machine learning repository. The experimental results indicate that the proposed classifier has exemplary classification accuracy on different types of biological data. Overall, the proposed classifier offers good prediction accuracy to new DNA variants classification where noisy and misclassified variants are optimised to increase test performance.

An approach to bankruptcy forecasting and solution is proposed.The Case-Based Reasoning paradigm is used, focusing on Revise step.Different from the past, pure CBR has been applied in a real case study.Compared with Z"-Score, the method shows good performance in predicting bankruptcy.The approach suggests how to act before the firm situation becomes irreversible. Bankruptcy prediction is a very important research trend: although statistical methods are mainly used in literature, techniques based on Artificial Intelligence are interesting from many points of view. Among them, Case-Based Reasoning (CBR) could be useful to cluster enterprises according to opportune similarity metrics as well as suggest proper actions to take for avoiding bankruptcy in border-line situations. In this paper, we present a new and still under development CBR approach to this problem, that seems to return better results than previous attempts. The approach is based on different kinds of similarity metrics and is focused on the implementation of innovative revise algorithms. In particular, the paper shows how the revise step is crucial to improve the accuracy of the bankruptcy prediction model.

A novel method for the assessment of trademark similarity is proposed.The method blends together visual, semantic and phonetic similarity.It produces an aggregated score based on the individual assessments.Evaluation using information retrieval measures and human judgment. Trademarks are intellectual property assets with potentially high reputational value. Their infringement may lead to lost revenue, lower profits and damages to brand reputation. A test normally conducted to check whether a trademark is highly likely to infringe other existing, already registered, trademarks is called a likelihood of confusion test. One of the most influential factors in this test is establishing similarity in appearance, meaning or sound. However, even though the trademark registration process suggests a multi-faceted similarity assessment, relevant research in expert systems mainly focuses on computing individual aspects of similarity between trademarks. Therefore, this paper contributes to the knowledge in this field by proposing a method, which, similar to the way people perceive trademarks, blends together the three fundamental aspects of trademark similarity and produces an aggregated score based on the individual visual, semantic and phonetic assessments. In particular, semantic similarity is a new aspect, which has not been considered by other researchers in approaches aimed at providing decision support in trademark similarity assessment. Another specific scientific contribution of this paper is the innovative integration, using a fuzzy engine, of three independent assessments, which collectively provide a more balanced and human-centered view on potential infringement problems. In addition, the paper introduces the concept of degree of similarity since the line between similar and dissimilar trademarks is not always easy to define especially when dealing with blending three very different assessments. The work described in the paper is evaluated using a database comprising 1400 trademarks compiled from a collection of real legal cases of trademark disputes. The evaluation involved two experiments. The first experiment employed information retrieval measures to test the classification accuracy of the proposed method while the second used human collective opinion to examine correlations between the trademark scoring/rating and the ranking of the proposed method, and human judgment. In the first experiment, the proposed method improved the F-score, precision and accuracy of classification by 12.5%, 35% and 8.3%, respectively, against the best score computed using individual similarity. In the second experiment, the proposed method produced a perfect positive Spearman rank correlation score of 1.00 in the ranking task and a pairwise Pearson correlation score of 0.92 in the rating task. The test of significance conducted on both scores rejected the null hypotheses of the experiment and showed that both scores correlated well with collective human judgment. The combined overall assessment could add value to existing support systems and be beneficial for both trademark examiners and trademark applicants. The method could be further used in addressing recent cyberspace phenomena related to trademark infringement such as customer hijacking and cybersquatting.

This paper assesses performance of 128 OECD banks from 2004 to 2013.An analytical approach that emulates the CAMELS rating system is used.Results reveal that contextual variables have a prominent impact on efficiency levels. This paper presents a performance assessment of 128 banks from 23 OECD countries from 2004 to 2013, using different financial criteria that emulate the CAMELS rating system. A robust TOPSIS approach for assessing bank efficiency is also developed and presented. First, alternative variable reduction techniques are employed to extract the major factors within each CAMELS criterion. This is done to mitigate collinearity issues. Then, TOPSIS is used to measure bank performance based upon these factors, equally weighted. A comprehensive analysis based on a weighted linear optimization model for multi-criteria classification is also performed, which detects any discrepancies from the original scores. Lastly, censored quantile regressions are combined with bootstrapped TOPSIS scores to produce a model for predicting the impact of different contextual variables on different efficiency quantiles. Results reveal that the effects of ownership, trend, and origin of the bank may vary with respect to efficiency levels, whether high or low.

Literature analysis for lateral transshipment models in complex networks.Multi-site multi-item multi-echelon model with unidirectional lateral transshipment.Model based on the system-approach with availability target and cost minimization.Genetic algorithm for the optimization of non-linear constrained function.A case study of a European airline shows the benefits of the model. Inventory management constitutes a fundamental decision-making problem, especially in systems which must guarantee high availability levels. In complex multi-echelon networks, in case of shortage at a location, resupplying from a near location on the same echelon rather than from the original supplier at the upper echelon, would be a potential faster and then more profitable policy. A wide interest in literature shows the importance of this policy, i.e. the lateral transhipment (LTR), as a means to reduce the inventory costs. This paper deals with unidirectional LTR, which often represent a reasonable policy in scenarios where backorders have different effects on the system. Based on METRIC, this paper defines a system-approach model for determining the stock levels of repairable items in a complex network, by a genetic algorithm optimization process. The model considers non-zero maintenance time for each item and different skills of maintenance centres, in a multi-echelon single-indenture system, with unidirectional LTR allowed. The expert system developed in the paper assists the decision maker to define the inventory levels for the maintenance sites across the system, taking advantage of the LTR to reduce costs and enhance availability. A case study of a European airline shows the relevance of the developed expert system, also considering its reproducibility to face different industrial contexts.

This is the first attempt to solve the SC design problem using IWD metaheuristic.We modify the single-objective IWD meta-heuristic to solve a bi-objective SC design problem.We compare our results to the ones computed by Ant Colony Optimisation (ACO).We solve several instances to show the performance of our hybrid algorithm.Our results outperform the ones computed by ACO. The Intelligent Water Drop (IWD) algorithm is inspired by the movement of natural water drops (WD) in a river. A stream can find an optimum path considering the conditions of its surroundings to reach its ultimate goal, which is often a sea. In the process of reaching such destination, the WD and the environment interact with each other as the WD moves through the river bed. Similarly, the supply chain problem can be modelled as a flow of stages that must be completed and optimised to obtain a finished product that is delivered to the end user. Every stage may have one or more options to be satisfied such as suppliers, manufacturing or delivery options. Each option is characterised by its time and cost. Within this context, multi-objective optimisation approaches are particularly well suited to provide optimal solutions. This problem has been classified as NP hard; thus, this paper proposes an approach aiming to solve the logistics network problem using a modified multi-objective extension of the IWD which returns a Pareto set.Artificial WD, flowing through the supply chain, will simultaneously minimise the cost of goods sold and the lead time of every product involved by using the concept of Pareto optimality. The proposed approach has been tested over instances widely used in literature yielding promising results which are supported by the performance measurements taken by comparison to the ant colony meta-heuristic as well as the true fronts obtained by exhaustive enumeration. The Pareto set returned by IWD is computed in 4źs and the generational distance, spacing, and hyper-area metrics are very close to those computed by exhaustive enumeration. Therefore, our main contribution is the design of a new algorithm that overcomes the algorithm proposed by Moncayo-Martinez and Zhang (2011).This paper contributes to enhance the current body of knowledge of expert and intelligent systems by providing a new, effective and efficient IWD-based optimisation method for the design and configuration of supply chain and logistics networks taking into account multiple objectives simultaneously.

Integrated robot framework t for navigation in a habituated environment is proposed.The robot's behavior obeys the rules of proxemics theory.Exploits the performed actions of humans to infer about its trajectory. As robots tend to establish their presence in every day human environments the necessity for them to attain socially acceptable behavior is a condition sine qua non. Consequently, robots need to learn and react appropriately, should they be able to share the same space with people and to reconcile their operation to man's activity. This work proposes an integrated robot framework that allows navigation in a human populated environment. This is the first work that employs the performed actions of individuals so as to re-plan and design a collision-free and at the same time a socially acceptable trajectory. Expandability is another feature of the suggested mapping module since it is capable of incorporating an unconstrained number of actions and subsequently responses, according to the needs of the task in hand and the environment in which the robot operates. Moreover, the paper addresses the integration of the proposed mapping module with the rest of the robot framework in order to operate in a seamless fashion. The generic design of this architecture allows the replacement of modules with other similar ones, thus providing adaptability with respect to the environment and so on. The method utilizes off-line constructed 3D metric maps organized in terms of a topological graph. During its perambulation the robot is ample to detect humans while it exploits deep learning strategies to recognize their activities. The memorized actions are seamlessly associated with specific rules -deriving from the proxemics theory- and are organized in an efficient manner to be recalled during robot's navigation. Moreover, the paper exhibits the differences of the robot navigation in inhabited and uninhabited environments and demonstrates the alteration of the robot's trajectory with respect to the recognized actions and poses of the individuals. The system has been evaluated on a robot able to acquire RGB-D data in domestic environments. The human detection and the action recognition modules exhibited remarkable performance, the human detection one was flawless about its decision while the action recognition one confused actions regarding the number of individuals that participate in them. Last, the robot navigation component was proved capable of extracting safe trajectories in human populated environments.

Adaptive learning rate has been proposed for Deep Learning in MLP.Technique for updating learning rate is free of hyper-parameters.Learning rate is a function of a parameter called learning parameter.Learning parameter is updated based on error gradient.Learning rate is further updated based on the Laplacian score of activation values. An attempt has been made to improve the performance of Deep Learning with Multilayer Perceptron (MLP). Tuning the learning rate or finding an optimum learning rate in MLP is a major challenge. Depending on the value of the learning rate, classification accuracy can vary drastically. This issue has been taken as a challenge in this paper. In this paper, a new approach has been proposed to combine adaptive learning rate in conjunction with the concept of Laplacian score for varying the weights. Learning rate is taken as a function of parameter which itself is updated on the basis of error gradient by forming mini-batches. Laplacian score of the neuron isfurther used for updating the incoming weights. This removes the bottleneck involved in finding the optimum value for the learning rate in Deep Learning by using MLP. It is observed on benchmark datasets that this approach leads to increase in classification accuracy as compared to the existing benchmark levels achieved by the well known methods of deep learning.

A method for including analogical reasoning with EBL is presented.Analogy is proposed as a method for impasse resolution.Extension of domain theory using analogy shown to cater for modular platforms. This paper proposes an algorithm for the inclusion of analogy into Explanation-Based Learning (EBL). Analogy can be used when an impasse is reached to extend the deductive closure of EBL's domain theory. This enables the generation of control laws, via EBL, for hardware which is not catered for in the domain theory. This advantage addresses a problem which represents a dearth in the current literature. Integrated Modular Avionics (IMA) literature has thus far been concerned with the architectural considerations. This paper seeks to address the impact of hardware changes on the controllers within an IMA architecture. An algorithm is proposed and applied to control an aviation platform with an incomplete domain theory. Control rules are generated when no deductive explanations are possible, which still reflect the intent of the domain theory.

This paper introduces several cooperative proactive S-Metaheuristics.The proposal is based on two characteristics of agents: proactivity and cooperation.Proactive S-Metaheuristics avoid local optima by adjusting parameters and operators.Simple forms of cooperation are used to combine proactive metaheuristics.The experiments consider binary problems, knapsack and travelling salesman problems. This paper introduces several cooperative proactive S-Metaheuristics, i.e. single-solution based metaheuristics, which are implemented taking advantage of two singular characteristics of the agent paradigm: proactivity and cooperation. Proactivity is applied to improve traditional versions of Threshold Accepting and Great Deluge Algorithm metaheuristics. This approach follows previous work for the definition of proactive versions of the Record-to-Record Travel and Local Search metaheuristics. Proactive metaheuristics are implemented as agents that cooperate in the environment of the optimization process with the goal of avoiding stagnation in local optima by adjusting their parameters. Based on the environmental information about previous solutions, the proactive adjustment of the parameters is focused on keeping a minimal level of acceptance for the new solutions. In addition, simple forms of cooperation by competition are used to develop cooperative metaheuristics based on the combination of the four proactive metaheuristics. The proposed metaheuristics have been validated through experimentation with 28 benchmark functions on binary strings, and several instances of knapsack problems and travelling salesman problems.

We implement a knowledge sharing system for DM.We use a unifying metamodel as the basis to represent all knowledge stored in the system.We illustrate the system in actual DM case studies. Timely knowledge sharing in disaster management (DM) is clearly vital, but it is remains challenging. Roles involved in DM processes often cut across many organizational boundaries and are dynamic. Knowledge involved is enormous and diverse. It includes information related to varieties of disasters, roles descriptions, plans and operations. Alas, practices may also vary across different regions and authorities. This paper makes a crucial contribution to address the knowledge sharing challenge by providing a knowledge based systems approach to facilitate structuring, storing and reusing DM knowledge.The contribution of this paper is three folds: Firstly, it presents a metamodel-based architecture suitable for various distributed knowledge sharing settings; Secondly, it presents an actual implementation of such a system, the Disaster Management Knowledge Repository (DMKR1.0). DMKR facilitates collaboration and DM knowledge sharing using a tailored DM language. This offers a flexible structure to allow the storage and retrieval not only of observed and measured data, but also interpretative and inferred information of the disaster management knowledge. Thirdly, the paper provides disaster management exemplars of how DMKR users can easily instantiate DM models to communicate and to generalize their knowledge for the benefit of sharing it within their community. This presents a compelling evidence of the soundness and the effectiveness of the overall approach to DM knowledge sharing.

We presented system for counting the gene markers in FISH images of breast cancer.We have developed the fusion system of several methods.The ensemble of methods improves greatly sensitivity and specificity of system. The paper presents an application of several methods of markers localization in fluorescent in situ hybridization images in order to determine HER2 status of the breast cancer samples. The applied methods implement different mathematical foundations of image processing and perform the analysis in an independent way. The paper proposes their fusion to obtain better results of spot recognition. The integration process of many methods takes into account different points of view on the classification problem and takes the best from each of them in developing the final solution. Thanks to this the improvement of the performance of the system is achieved. The efficiency of the developed system in the form of sensitivity and specificity has been verified on the examples of analysis of many FISH images. They confirm the advantage of using several methods of image processing combined in the form of an ensemble.

Quantification and objective estimation of driver fatigue in real prolonged driving.Simultaneous recording of physiological parameters in wireless and nonintrusive way.Develop a dynamic fatigue detection model by multiple features and contexts. Driver's states in successive time slices are not independent, especially, fatigue is one of a cognitive state that is developing over time. Meanwhile, driver fatigue is also influenced by some corresponding contextual information at a certain time. In such case, classifying driving state at each time slice separately from it in before and after time slices obviously has less meaning. Therefore, a dynamic fatigue detection model based on Hidden Markov Model (HMM) is proposed in this paper. Driver fatigue can be estimated by this model in a probabilistic way using various physiological and contextual information. Electroencephalogram (EEG), Electromyogram (EMG), and respiration signals were simultaneously recorded by wearable sensors and sent to computer by Bluetooth during the real driving. From these physiological information, fatigue likelihood can be achieved using kernel distribution estimate at different time sections. Contextual information offered by specific environmental factors were used as prior of fatigue. As time proceeds, the posterior of fatigue can be gotten dynamically by this HMM-based fatigue recognition method. Based on the results of the method in this paper, it shows that it provides an effective way in detecting driver fatigue.

Developing a new EEG sleep stages classification method based on the statistical features in time domain and complex networks properties.The method provides better EEG sleep signals classification compared with the existing approaches reported.Finding of not all sleep stages can be classified with the same number of the statistical features.Stage Awake can be classified with a fewer statistical features due to including high activity compared with other sleep stages. Sleep stage scoring is a challenging task. Most of existing sleep stage classification approaches rely on analysing electroencephalography (EEG) signals in time or frequency domain. A novel technique for EEG sleep stages classification is proposed in this paper. The statistical features and the similarities of complex networks are used to classify single channel EEG signals into six sleep stages. Firstly, each EEG segment of 30s is divided into 75 sub-segments, and then different statistical features are extracted from each sub-segment. In this paper, feature extraction is important to reduce dimensionality of EEG data and the processing time in classification stage. Secondly, each vector of the extracted features, which represents one EEG segment, is transferred into a complex network. Thirdly, the similarity properties of the complex networks are extracted and classified into one of the six sleep stages using a k-means classifier. For further investigation, in the statistical features extraction phase two statistical features sets are tested and ranked based on the performance of the complex networks. To investigate the classification ability of complex networks combined with k-means, the extracted statistical features were also forwarded to a k-means and a support vector machine (SVM) for comparison. We also compare the proposed method with other existing methods in the literature. The experimental results show that the proposed method attains better classification results and a reasonable execution time compared with the SVM, k-means and the other existing methods. The research results in this paper indicate that the proposed method can assist neurologists and sleep specialists in diagnosing and monitoring sleep disorders.

The paper addresses the problem of literary writing style determination.The literary writing style of an author is treated as "a random number generator".The method relies on the two-sample test methodology.The method is language independent in the community of alphabetic languages. In this paper, we address the problem of literary writing style determination using a comparison of the randomness of two given texts. We attempt to comprehend if these texts are generated from distinct probability sources that can reveal a difference between the literary writing styles of the corresponding authors. We propose a new approach based on the incorporation of the known Friedman-Rafsky two-sample test into a multistage procedure with the aim of stabilizing the process. A sampling procedure constructed by applying the N-grams methodology is applied to simulate samples drawn from the pooled text with the aim of evaluating the null hypothesis distribution that appears after the writing styles coincide. Next, samples from different files are selected, and the p-values of the test statistics are calculated. An empirical distribution of these values is compared numerous times with the uniform one on the interval 0, 1, and the writing styles are recognized as different if the rejection fraction in this comparison's sequence is significantly greater than 0.5. The offered approach is language independent in the community of alphabetic languages and does not involve the use of linguistics. In comparison with most existing methods our approach does not deal with any authorship attribute determination. A text itself, more precisely speaking, the distribution of sequential text templates and their mutual occurrences essentially identifies the style. Experiments demonstrate the strong capability of the proposed method.

A framework for estimating national and regional innovation efficiency is presentedThe proposed DEA-based model is formulated as a multiobjective mathematical programMultiple objectives refer to different stages and hierarchies of innovation systemsOrdinal regression analysis examines the influence of additional variablesEfficiency results show significant differences across countries and regions Evaluating the efficiency of innovation systems can serve as a substantial enabling tool for policymaking serving to identify best practices and develop potential improvements of actions and strategies. It also serves to provide valuable insight in understanding the nature and dynamics of innovation process at its different stages and levels. The main aim of the paper is to present an integrated assessment and classification framework for national and regional innovation efficiency. The proposed model is based on Data Envelopment Analysis and is formulated as a multiobjective mathematical program in order to consider the objectives and constraints of the different stages and levels of the innovation process. Additionally, the model copes with DEA inconsistencies when ratio measures are employed. In the second part of the study, a multicriteria decision aid approach, based on an ordinal regression model, is applied in order to study how environmental factors on innovation and entrepreneurship affect the estimated efficiency scores. The proposed approach is applied to a set of 23 European countries and their 185 corresponding regions. The results show that there are large differences regarding the efficiency scores of the different stages and levels, implying the existence of significant divergences from the expected norm concerning innovation efficiency. The contribution of the paper lies (i) in the proposed multiobjective model, which is able to model the multiple stages and levels of the innovation process and handle ratio measures without requiring the same set of inputs and outputs at different levels and (ii) in the presented application of the model in the efficiency evaluation of innovation systems, including a meta-analysis of the results based on the framework of the Quadruple Innovation Helix. Such an approach may provide a valuable tool for country/region comparison and policy formulation.

An intelligent system for bill of quantities information management is proposed.The system is implemented using a web-based application.The system imports and classifies information with a high percentage of success.The integration of bill of quantities data permits to make more reliable decisions. Construction projects success largely depends on a good access to and management of information, which is stored in different databases and applications (even on paper). This heterogeneity makes the management and decision making process difficult. One of the most relevant documents in the project management context is the Bill of Quantities (BoQ), which is a collection of work descriptions specifying, in a textual way, the nature of the different tasks needed to be done in order to achieve the project goal. Since there are no standards for developing the BoQ, its structure and linguistics vary among practitioners, making the acquisition and management of the information contained in this document very laborious. In this paper, i-BoQ, an intelligent system for retrieving and structuring data coming from BoQ, is presented. As we will see, intelligent capabilities together with a friendly web-based application allow to easily acquire and manage integrated BoQ information for supporting decision making in the construction project management.

We describe method for purifying category structure of Wikipedia.We propose three methods for identification of associations between categories using SVM.Evaluation indicates the methods allows us to identify new significant relations.The aggregated results have been used for visualization of Wikipedia categories. Description of the data using categories allows one to describe it on a higher abstraction level. In this way, we can operate on aggregated groups of the information, allowing one to see relationships that do not appear explicit when we analyze the individual objects separately. In this paper we present automatic identification of the associations between categories used for organization of the textual data. As experimental data we used a network of English Wikipedia articles and their associated categories, that have been preprocessed by a dedicated filtering method for noise reduction. The main contribution of the paper is the introduction of the method based on supervised machine learning for mining relations between these categories. We describe existing in the literature category proximity metrics as well as introduce three new ones, based on observing the properties of a multilabel Support Vector Machine classifier. The first metric uses classifier predictions, the second uses its errors, and the third is based on its model. Comparison to the existing state-of-the-art methods, and to manual assessments, confirm that the proposed methods are useful and are more flexible than typical approaches. We show how different metrics allow us to introduce new significant relations between categories. Aggregated results of mining categories' associations have been used to build a semantic network that shows a practical application of the research. The proposed method for finding associations can be extended with using other approaches than SVM classification, and can find (other than presented in the paper) applications for mining categories in text repositories. Eg.: it can be used for extending the prediction of the rating in recommender systems or as a method of missing data imputation.

Self-tuning and detector power is introduced to address improper coverage of NSA.Cooperation among agents makes correct identification of anomaly and lower FAR.EPAADPS improves anomaly detection and reduces FAR compared to state of art.Preventive mechanism identifies and contains novel and zero day attacks. Artificial Immune System (AIS) is inspired from Biological Immune System (BIS) and demonstrates a lot of interesting facets and intelligence that include self-learning, self adaption, self regulatory, distributed with self/non-self detection capabilities. Due to these astonishing qualities AIS are predominantly used in anomaly detection where anomalies are treated as non-self that needs to be detected. Therefore, AIS appears appropriate for development of a proactive system to identify and prevent novel and unseen anomalies. This paper presents "An Efficient Proactive Artificial Immune System based Anomaly Detection and Prevention System (EPAADPS)" which embodies immune attributes to distinguish self and non-self in quest to identify and prevent novel, unseen anomalies. Negative Selection Algorithm (NSA) is a key AIS concept and is used for anomaly detection in various publications. Despite its relative success, detector selection and thereafter anomaly detection demands a more effective algorithm. This paper put forwards concept of self-tuning of detectors and detector power in NSA with the intension to make a detector evolve and facilitate better and correct self and non-self coverage. Thereafter, agents accompanying detectors collaborate and communicate between themselves to proactively discover correct anomalies and then take appropriate preventive measures. The performance of EPAADPS is contrasted with closely related state of art RNS algorithm using real valued representation and Euclidean distance. Experimental results revels promising EPAADPS performance which very comfortably outperforms the RNS. Furthermore, these results also demonstrate that EPAADPS shows remarkable resilience and intelligence in detecting novel unseen anomalies and with preventive measures to overcome the threat perception.

This paper proposes a deep convolutional neural network for HAR using smartphone sensors.Experiments show that the proposed method derives relevant and more complex features.The method achieved an almost perfect classification on moving activities.It outperforms other state-of-the-art data mining techniques in HAR. Human activities are inherently translation invariant and hierarchical. Human activity recognition (HAR), a field that has garnered a lot of attention in recent years due to its high demand in various application domains, makes use of time-series sensor data to infer activities. In this paper, a deep convolutional neural network (convnet) is proposed to perform efficient and effective HAR using smartphone sensors by exploiting the inherent characteristics of activities and 1D time-series signals, at the same time providing a way to automatically and data-adaptively extract robust features from raw data. Experiments show that convnets indeed derive relevant and more complex features with every additional layer, although difference of feature complexity level decreases with every additional layer. A wider time span of temporal local correlation can be exploited (1?9-1?14) and a low pooling size (1?2-1?3) is shown to be beneficial. Convnets also achieved an almost perfect classification on moving activities, especially very similar ones which were previously perceived to be very difficult to classify. Lastly, convnets outperform other state-of-the-art data mining techniques in HAR for the benchmark dataset collected from 30 volunteer subjects, achieving an overall performance of 94.79% on the test set with raw sensor data, and 95.75% with additional information of temporal fast Fourier transform of the HAR data set.

Highlights • This paper presents a systematic review of the literature on two-stage DEA in banks; • We identified seven gaps in the literature for two-stage DEA models; and • We discussed several controversial points regarding two-stage DEA models., Given the importance that two-stage Data Envelopment Analysis (DEA) models have attained in recent years, this paper presents a systematic review of the literature on the topic focusing on the banking industry. We discuss the two-stage terminology itself, which is not yet not consolidated. We also discuss the current state-of-the-art and present opportunities, as well as challenges, for future studies. We analyse 59 papers, divided them into ten classes that cover various perspectives of two stage DEA studies, such as the economic context, geographic region of the banking units, methodological characteristics, and type of the models, either internal or external. Additionally, we investigate several controversial points regarding two-stage DEA models, such as the variable selection approach, the technique used in the second stage, and the possible impact of non-discretionary variables on efficiency. Results of the literature review indicate the lack of a uniform or universal terminology for two-stage DEA models in the baking industry. Moreover, the main objective of most papers involves extending or improving DEA models. Radial models, with variable returns of scale, and the intermediation approach are the most frequent configurations. Finally, we identify seven gaps in the literature for both internal and external two-stage DEA models and two specific gaps to external ones.Each gap is discussed in depth in the text and can be considered opportunities for future studies.

Integrating return prediction of traditional time series models in portfolio formation can improve the performance of original portfolio optimization model. Since machine learning and deep learning models have shown overwhelming superiority than time series models, this paper combines return prediction in portfolio formation with two machine learning models, i.e., random forest (RF) and support vector regression (SVR), and three deep learning models, i.e., LSTM neural network, deep multilayer perceptron (DMLP) and convolutional neural network. To be specific, this paper first applies these prediction models for stock preselection before portfolio formation. Then, this paper incorporates their predictive results in advancing mean–variance (MV) and omega portfolio optimization models. In order to present the superiority of these models, portfolio models with autoregressive integrated moving average’s return prediction are used as benchmarks. Evaluation is based on historical data of 9 years from 2007 to 2015 of component stocks of China securities 100 index. Experimental results show that MV and omega models with RF return prediction, i.e., RF+MVF and RF+OF, outperform the other models. Further, RF+MVF is superior to RF+OF. Due to the high turnover of these two models, this paper discusses their performance after deducting the transaction fee cased by turnover. Experiments present that RF+MVF still performs the best among MVF models and omega model with SVR prediction (SVR+OF) performs the best among OF models. Moreover, RF+MVF performs better than SVR+OF and high turnover erodes nearly half of their total returns especially for RF+OF and RF+MVF. Therefore, this paper recommends investors to build MVF with RF return prediction for daily trading investment.

Educational timetabling is an ongoing challenging administrative task that is required in most academic institutions. This is mainly due to a large number of constraints and requirements that have to be satisfied. Educational timetabling problems have been classified as NP-hard problems and can be divided into three types: exam timetabling, course timetabling and high school timetabling. The domain of high school timetabling is not well developed when compared to other fields of educational timetabling such as university exam timetabling and course timetabling. As the evolution of the educational systems are continuous, new challenges often arise, requiring new models and solution methodologies. Over the years, a number of methodologies have been developed to address high school timetabling problems. However, there are no comparative studies or rigorous analysis of these methodologies. This survey paper aims to provide a scientific review of high school timetabling. The paper presents a categorisation of the methodologies conducted in recent years based on chronology, category and application (dataset). We first present comparative studies on the success of proposed methodologies. The components and mechanisms of different methodologies are analysed and compared. We also discuss their performance, advantages, disadvantages and potential for improvement. Methodology wise, a shift of popularity from meta-heuristic to mathematical optimisation is observed in recent years. Another observation is that more researchers are opting for XHSTT formatted datasets as a testbed for their algorithms. Finally, we outline the industrial perspective, trends and future direction in high school timetabling optimisation problems.

Conflicting objectives such as minimizing weight and minimizing the maximum nodal displacement, with constraints on normal stresses in the bars, is a common multi-objective structural optimization problem widely found in the literature. This paper proposes multi-objective structural optimization problems with the combination of new conflicting objectives functions and constraints, such as the natural frequencies of vibration and the load factors concerning the global stability of the structure. The solution for these problems may be of great interest in the field of structural engineering, not yet discussed in the literature. The problems analyzed in this paper deal with both discrete and continuous sizing, shape, and layout design variables. The search algorithm adopted here is a modified version of the Differential Evolution called the Third Evolution Step Differential Evolution (GDE3). Several experiments are analyzed with their Pareto-fronts showing the non-dominated solutions. The solutions are defined after obtaining the Pareto curve, which is one of the most important steps and a task that may not be trivial for the Decision Maker. This paper involves a strategy that establishes criteria defining weights (importance) for each objective function and, through these values, enables comparison scenarios. The numerical experiments include plane and spatial benchmark trusses.

Smartphone sensing capabilities have enabled human activity recognition (HAR) solutions to better understand human behavior through computational techniques. However, such solutions have suffered from scalability problems due to the high consumption of computational resources (e.g. memory and processing) and the difficulty of acting in real time due to not observing data evolution over time. These problems occur because the HAR solutions for smartphones have been solved through offline learning with models limited by a data history. The disadvantage of this approach is that human activities constantly change over time and are strongly influenced by the physical environment and user profile. To overcome such problem, this paper proposes a novel low-cost learning algorithm called NOHAR (NOvelty discrete data stream for Human Activity Recognition), focused on continuous flow of data analysis. NOHAR is an online classification algorithm based on symbolic data generated by a discretization process using algorithms as SAX and SFA. The advantages of these algorithms are their abilities to compress and reduce the dimensionality of data. In addition, this paper proposes a new framework called DISTAR (DIscrete STream learning for Activity Recognition) focused on the data streaming analysis. Its goals include standardizing the development of online algorithms for symbolic data. Experimental results using three databases show that NOHAR is on average 33 times faster than the state of the art and can reduce memory consumption by an average of 99.97%.

Differential Evolution Algorithm (DE) is a commonly used stochastic search method for solving real-valued numerical optimization problems. Unfortunately, DE's problem solving success is very sensitive to the internal parameters of the artificial numerical genetic operators (i.e., mutation and crossover operators) used. Although several mutation and crossover methods have been developed for DE, there is not still an analytical method that can be used to select the most efficient mutation and crossover method while solving a problem with DE. Therefore, selection and parameter tuning processes of artificial numerical genetic operators used by DE are based on a trial-and-error process which is time consuming. The development of modern DE versions has been focused on developing fast, structurally simple and efficient genetic operators that are not sensitive to the initial values of their internal parameters. Problem solving successes of the Universal Differential Algorithms (uDE) are not sensitive to the structure and internal parameters of the related artificial numerical genetic operators used, unlike DE. In this paper a new uDE, Bezier Search Differential Evolution Algorithm, BeSD, has been proposed. BeSD’s mutation and crossover operators are structurally simple, fast, unique and produce highly efficient trial patterns. BeSD utilizes a partially elitist unique mutation operator and a unique crossover operator. In this paper, the experiments were performed by using the 30 benchmark problems of CEC2014 with Dim=30, and one 3D viewshed problem as a real world application. The problem solving success of BeSD was statistically compared with five top-methods of CEC2014, i.e., CRMLSP, MVO, WA, SHADE and LSHADE by using Wilcoxon Signed Rank test. Statistical results exposed that BeSD’s problem solving success is better than those of the comparison methods in general.