Search

This article explores the application of image processing techniques in recyclable waste paper sorting. In recycling, waste papers are segregated into various grades as they are subjected to different recycling processes. Highly sorted paper streams facilitate high quality end products and save processing chemicals and energy. From 1932 to 2009, different mechanical and optical paper sorting methods have been developed to fill the paper sorting demand. Still, in many countries including Malaysia, waste papers are sorted into different grades using a manual sorting system. Because of inadequate throughput and some major drawbacks of mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. Automated paper sorting systems offer significant advantages over human inspection in terms of worker fatigue, throughput, speed, and accuracy. This research attempts to develop a smart vision sensing system that is able to separate the different grades of paper using first-order features. To construct a template database, a statistical approach with intra-class and inter-class variation techniques are applied to the feature selection process. Finally, the K-nearest neighbor (KNN) algorithm is applied for paper object grade identification. The remarkable achievement obtained with the method is the accurate identification and dynamic sorting of all grades of papers using simple image processing techniques.

As printing machines attain higher operating speeds, paper feeding mechanisms are more prone to problems such as vibration, noise, and paper jams. To design reliable paper feeding mechanisms, designers first use heuristic knowledge to decide the basic specifications of the printer according to the user's requirements. In the preliminary design stage, the design process is represented hierarchically and the characteristics of each part are determined. Conceptually, the process is analogous to the methodology used in configuration design. In this research, the design process has been analyzed systematically by the OMT (object modeling technique) method, which integrates the object, functional, and dynamic models. The physical parts of the paper feeding mechanism are represented as objects, and the design knowledge and design constraints are represented by rules and methods. A commercial expert system shell, Nexpert Object, is adapted for the implementation. The inferred results are converted to create the BOM (bill of materials) data and are saved in a database for the detailed design and production stage.

Feature selection determines relevant features in the data. It is often applied in pattern classification, data mining, as well as machine learning. A special concern for feature selection nowadays is that the size of a database is normally very large, both vertically and horizontally. In addition, feature sets may grow as the data collection process continues. Effective solutions are needed to accommodate the practical demands. This paper concentrates on three issues: large number of features, large data size, and expanding feature set. For the first issue, we suggest a probabilistic algorithm to select features. For the second issue, we present a scalable probabilistic algorithm that expedites feature selection further and can scale up without sacrificing the quality of selected features. For the third issue, we propose an incremental algorithm that adapts to the newly extended feature set and captures `concept drifts' by removing features from previously selected and newly added ones. We expect that research on scalable feature selection will be extended to distributed and parallel computing and have impact on applications of data mining and machine learning.

Knowledge-based systems and, particularly, expert systems, are bringing new thinking to how we view knowledge. Increasingly, we see knowledge as a commodity or an object, something generated, discovered, restructured, repackaged and deliverrd Powerful tools have been developed for expediting our work in manipulating knowledge. Knowedge-based systems provide the structure, the process and multidisciplinary integration tools to better understand and further develop projects in areas such as reengineering the organization, concurrent engineering, quality management and other critical management efforts in business and government. Curriculum development in education also benefits greatly from using the integrative powers of the KBS disciplines Examples taken from education focus on knowledge-based systems applied to the areas of K-12 course design, bachelor's degree curriculum design in integrated science, and graduate studies serving “professional transitioning.” Concepts of “idea fields” in organizational behavior are also discussed.

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

In this paper, we address two research topics in Recommender Systems (RSs) which have been developed in parallel without a deeper integration: Cross-Domain RS (CDRS) and Context-Aware RS (CARS). CDRS have emerged to enhance the quality of recommendations in a target domain by leveraging sources of information in different domains. CDRS are especially useful to address cold-start, sparsity and diversity problems in target domains with scarce information. CARS, on its turn, have been proposed to consider contextual information for recommendations. Such systems are suitable when the users’ interests change according to factors like time, location, among others. By combining these two approaches, better RSs can be developed, considering both the availability of useful data from multiple domains and the use of contextual information. In this paper, we formalize the combination of CDRS and CARS, which represents a more systematic integration of these approaches compared to previous work. Based on this formulation, we developed novel RSs techniques, named CD-CARS. To evaluate the developed CD-CARS techniques, we performed extensive experimentation through real datasets taking into account several scenarios. The recommendations were evaluated in terms of predictive and ranking performance, respectively achieving up to 62.6% and 45%, depending on the scenario, in comparison to traditional cross-domain collaborative filtering techniques. Therefore, the experimental results have shown that the integration of techniques developed in isolation can be useful in a variety of situations, in which recommendations can be improved by information gathered from different sources and can be refined by considering specific contextual information.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Every music composition has a composer at the core of its building block, molding it into a style of their own. The creative compositional style of a composer varies dynamically with every composer which is perishable and inimitable but cannot be preserved. This paper proposes a hybrid style transfer model which is an end-to-end approach to transfer style, compose as well as evaluate the style transfer accuracy in the domain of the target music composer. The paper focuses on 3 composer maestros Liszt, Chopin and Schubert taken from the Maestro dataset. The main step of music composer style transfer is accomplished in 3 systematic steps, training composer classifiers according to feature sets, generating a model of a composition in a particular composer’s style from noise, and finally style transfer and its evaluation. The 3 steps are interconnected in a way that each step is the building block for the next step. The GAN architecture of the style transfer step is built out of the GAN architecture of the second step. The compositions generated from each architecture is finally evaluated by the common pre-trained classifier of the first step. The highest accuracy obtained is 80% for composer classification using the maestro dataset, 77.27% for the classification of the generated style transferred version of a composition into the target composer class using the pre-trained classifiers.

This paper presents a novel indoor tracking system built with common data mining techniques on radio frequency identification (RFID) tags readings. The system allows tracking of several objects in real-time in a smart home context and is a building block toward the deployment of an expert system to enable aging in place through technology. The indoor localization is modelled as a classification problem, instead of a regression problem as commonly seen in the literature. The paper is divided in two parts. The first one focuses on the ground truth collection that led to the model construction. The second part focuses on the filters that were designed to enable this model to be used in real-time in the smart home as a tracking software. Results from the first part show that most classifiers perform well on the static positioning of RFID tags task, with a random forest of 100 trees performing best at 97% accuracy and 0.9740974 F-Measure. However, collecting data to train the classifier is a long and tedious process. Results from the second part indicate that the accuracy of the random forest drops significantly when confronted with human interference. With the help of some filters, the tracking accuracy of objects can still be as high as 75%. Those results confirm that using passive RFID tags for an indoor tracking system is viable. Our system is easy to deploy and more flexible than trilateration or fingerprinting systems.

As an important tool for information fusion, evidence theory has been widely applied in many areas. Unlike spatial evidence combination, temporal evidence combination is sequential and dynamic, which calls for new temporal evidence combination rule. In this paper, temporal evidence is combined based on relative reliability evaluation and evidence discounting. We first recall the method of evidence reliability evaluation based on intuitionistic fuzzy multiple criteria decision making (ERE-IFMCDM). Based on ERE-IFMCDM method, relative reliability factors of evidence sources in neighboring time nodes can be obtained. Then, according to evidence discounting and Dempster's combination rule, a method for temporal evidence combination based on the relative reliability factor is developed. Numerical examples and simulation demonstrate that the proposed method is time sensitive, which can reflect the dynamic feature of temporal information fusion. Moreover, the proposed method can deal with conflict in temporal fusion much better, which can enhance the anti-interference performance of the fusion system. The fusion framework proposed in this paper provides a dynamic perspective of the fusion of temporal uncertain information. It is helpful for the structural design of intelligent fusion system based on multiple temporal-spatial information.

To assess the current mental state of an individual, several monitoring systems have been developed. In this paper, we explore the possibility to exploit information recorded noninvasively from the human cortex to develop a brain-computer interface (BCI) able to estimate brain workload and the mental efforts during a cognitive task. The EEG-based workload classifier presented in this paper combines a power spectral density (PSD) analysis and a statistical criterion. The proposed classifier is applied in the context of distance education and online course platform through two experimental protocols. The first one proposes solving a set of matrices products using pen and paper, while the second one proposes answering problems of logic mathematics on a computer-based learning environment. Experimental results show that the averaged accuracy of distinguishing changes in the theta [4–7 Hz] (θ) band is 79%. For the alpha band [8–11 Hz] (α) the averaged accuracy reached 78%. Based on this classifier, we demonstrate that θ and α powers in central, and posterior sites decrease with the increase in difficulty level of the cognitive task. The accuracy of correct decisions obtained from our results are significantly enhanced while comparing our investigation to some similar works from literature. In the realm of intelligent expert systems, our work results represent a first step to an implementation of an intelligent system for the evaluation of reeducative therapies to be used in physiotherapy centers for children with cognitive disorders as it is the case for Cerebral Palsy.

In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been studied extensively in the last decade, proposing many exact and heuristic methods to minimize the total number of arc crossings. However, despite its practical significance, the min–max variant in which the maximum number of crossings over all edges is minimized, has received very little attention. We propose new heuristic methods based on the strategic oscillation methodology to solve this NP-hard optimization problem. Our experimentation shows that the new method compares favorably with the existing ones, implemented in current graph drawing expert systems. Therefore, a direct application of our findings will improve these functionality (i.e., crossing reduction) of drawing systems.

This study evaluates the performance of different data clustering approaches for searching the profitable consumer segments in the UK hospitality industry. The paper focuses on three aspects of datasets including the ordinal nature of data, high dimensionality and outliers. Data collected from 513 sample points are analysed in this paper using four clustering approaches: Hierarchical clustering, K-Medoids, fuzzy clustering, and Self-Organising Maps (SOM). The findings suggest that Fuzzy and SOM based clustering techniques are comparatively more efficient than traditional approaches in revealing the hidden structure in the data set. The segments derived from SOM has more capability to provide interesting insights for data-driven decision making in practice. This study makes a significant contribution to literature by comparing different clustering approaches and addressing misconceptions of using these for market segmentation to support data-driven decision making in business practices.

In recent years, the growing availability of huge amounts of information, generated in every sector at high speed and in a wide variety of forms and formats, is unprecedented. The ability to harness big data is an opportunity to obtain more accurate analyses and to improve decision-making in industry, government and many other organizations. However, handling big data may be challenging and proper data integration is a key dimension in achieving high information quality. In this paper, we propose a novel approach to data integration that calibrates online generated big data with interview based customer survey data. A common issue of customer surveys is that responses are often overly positive, making it difficult to identify areas of weaknesses in organizations. On the other hand, online reviews are often overly negative, hampering an accurate evaluation of areas of excellence. The proposed methodology calibrates the levels of unbalanced responses in different data sources via resampling and performs data integration using Bayesian Networks to propagate the new re-balanced information. In this paper we show, with a case study example, how the novel data integration approach allows businesses and organizations to get a bias corrected appraisal of the level of satisfaction of their customers. The application is based on the integration of online data of review blogs and customer satisfaction surveys from the San Francisco airport. We illustrate how this integration enhances the information quality of the data analytic work in four of InfoQ dimensions, namely, Data Structure, Data Integration, Temporal Relevance and Chronology of Data and Goal.

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

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

This paper presents the Storybox Methodology which combines a novel framework for structuring knowledge and conversations around a story (D-PAF), with a live chatroom-based training approach that builds the conversation knowledge base via live chatroom interactions. Chatbots have achieved success as intelligent interfaces in education, health, sales and support, but their move towards mainstream adoption has been hindered by the large amount of development resources required, in terms of data collection, preparation, user testing and technical knowledge. The complexity of the development task often necessitates both a system author and a domain expert working effectively together, adding further complexity and risk. Overcoming these barriers could increase feasibility of chatbots in a range of expert contexts. In education, there are groups of learners who do not enjoy reading and writing. Storytelling chatbots might be able to introduce these groups to enjoyable new ways to read and write, having a beneficial impact on their education and future prospects. This paper proposes the Storybox Methodology for the rapid development of storytelling chatbots. Storybox is evaluated by creating, training and testing ‘The Ghost’, a chatbot enacting Hamlet's Ghost character from William Shakespeare's dramatic tragedy. The results showed that after a period of live chatbot training of only 25 training conversations, The Ghost was able to conduct convincing conversations with participants.

Lithology identification is an important part of petroleum drilling engineering. Accurate identification of lithology is the foundation to ensure the smooth operation of drilling engineering. Conventional lithology recognition mainly relies on human experience. The recognition accuracy depends on the level of technical personnel and the recognition response time is lagging. It is difficult to meet the demand. How to achieve rapid and intelligent recognition of lithology is one of the core technical problems faced by oil drilling. In order to solve this problem, this paper uses the mechanical specific energy and other ground parameters to establish a rapid and intelligent recognition method of lithology based on the simulated annealing optimization support vector machine model. In order to improve the accuracy of the model recognition, a large number of methods have been developed from two classes and multiple classes, simulation analysis results show that the lithology recognition model based on the principle of mechanical specific energy and the simulated annealing optimization support vector machine algorithm can predict a priori unknown data with a prediction accuracy of over 90%. Compared with the support vector machine model and the K-means model, simulated annealing optimization support vector machine is used for comparative analysis, the algorithm to establish a lithology recognition model has better performance and higher accuracy. The intelligent identification model of lithology based on the principle of mechanical specific energy and simulated annealing optimization support vector machine algorithm established in this paper can quickly and accurately identify lithology, and provide new technical support for oil drilling formation analysis.

Performance measurement is one of the most essential real life decision making problems faces several criteria and different types of uncertainty and vagueness. Human expertise is mandatory for such situation although it is not enough to overcome such complicated cases. Expert systems which can sense, analyze and incorporate all details of real life decision making problems are required. In this paper an expert system is proposed in form of an uncertain Data Envelopment Analysis (DEA) approach. More formally a mixed fuzzy-robust uncertainty is addressed in the proposed DEA. Two scenario-based robust DEA models under Constant Return to Scale (CRS) and Variable Return to Scale (VRS) conditions have been proposed. Since the observed values for the inputs and outputs of Decision Making Units (DMUs) in each scenario may be ambiguous or vague, fuzzy DEA models corresponding to each of the robust scenarios are developed. So, this paper proposes four fuzzy-robust DEA models, which simultaneously maintain the advantage of each of the fuzzy and robust approaches, and at same time calculate the upper and lower bounds of the efficiency scores of DMUs under CRS and VRS conditions. Finally, to evaluate the validity and applicability of the proposed models, two numerical examples and a real case study in Small and Medium-sized Enterprises (SMEs) are presented and discussed.

Sentiment analysis helps evaluating the performance of products or services from user generated contents. Lexicon based sentiment analysis approaches are preferred over learning based ones when training data is not adequate. Existing lexicons contain only unigrams along with their sentiment scores. It is observed that sentiment n-grams formed by combining unigrams with intensifiers or negations show improved results. Such sentiment n-gram lexicons are not publicly available. This paper presents a methodology to create such a lexicon called Senti-N-Gram. Proposed rule-based approach extracts the n-grams sentiment scores from a random corpus containing product reviews and corresponding numeric rating in five-point scale. The scores from this automated procedure are compared with that of the human annotators using t-test and found to be statistically equivalent. The paper also proposes a sentiment classification methodology by using a ratio based approach based on counts of positive and negative sentences of a document. When used Senti-N-Gram lexicon, proposed method outperforms well-known unigram-lexicon based approach using VADER and an n-gram sentiment analysis approach SO-CAL.

International audience; Prognostics and health management can improve the reliability and safety of transportation systems. Data collected from diverse sources provide a chance and at the same time a challenge for data-driven PHM methods and models. The data often exhibit challenging characteristics like imbalanced data on normal and faulty conditions, noise and outliers, data points of different importance for the data-driven model, etc. In this paper, a k nearest neighbors-based fuzzy support vector machine is proposed for reducing the computational burden and tackling the issue of imbalance and outlier data, in fault detection. Fault detection is mathematically a classification problem. In this paper, the reverse nearest neighbors technique is adopted for detecting outliers and the k nearest neighbors technique is used to identify the borderline points for defining the classification hyperplane in support vector machines. Considering the position of each data point and the distribution of its nearest neighbors, a new method is proposed for calculating their estimation error costs. The proposed method is verified by comparison with several benchmark methods on five public datasets. Then, a real case study concerning fault detection in a braking system of a high-speed train is considered.

In statistics, machine learning, and related fields, feature selection is the process of choosing a smaller subset of features to work with. This is an important topic since selecting a subset of features can help analysts to interpret models and data, and to decrease computational runtimes. While many techniques are purely automatic, the data visualization community has produced a number of interactive approaches where users can make decisions taking into account their domain knowledge. In this paper we propose a new visualization technique based on radial axes that allows analysts to perform feature selection effectively, in contrast to previous radial axes methods. This is achieved by employing alternative scaled axes that provide insight regarding the features that have a smaller contribution to the visualizations. Therefore, analysts can use the technique to carry out interactive backwards feature elimination, by discarding the least relevant features according to the information on the plots and their expertise. Our approach can be coupled with any linear dimensionality reduction method, and can be used when performing analyses of cluster structure, correlations, class separability, etc. Specifically, in this paper we focus on combining the proposed technique with methods designed for classification. Lastly, we illustrate the effectiveness of our proposal through a case study analyzing high-dimensional medical chronic conditions data. In particular, clinicians have used the technique for determining the most important features that discriminate between patients with diabetes and high blood pressure.

Over the last few years, we have been witnessing a dramatic progress of deep learning in many real world applications. Deep learning concepts have been originated in the area of neural network and show a quantum leap in effective feature learning techniques such as auto-encoders, convolutional neural networks, recurrent neural networks etc. In the case of kernel machines, there are several attempts to model learning machines that mimic deep neural networks. In this direction, Multilayer Kernel Machines (MKMs) was an attempt to build a kernel machine architecture with multiple layers of feature extraction. It composed of many layers of kernel PCA based feature extraction units with support vector machine having arc-cosine kernel as the final classifier. The other approaches like Multiple Kernel Learning (MKL) and deep core vector machines solve the fixed kernel computation problem and scalability aspects of MKMs respectively. In addition to this, there are lot of avenues where the use of unsupervised MKL with both single and multilayer kernels in the multilayer feature extraction framework have to be evaluated. In this context, this paper attempts to build a scalable deep kernel machines with multiple layers of feature extraction. Each kernel PCA based feature extraction layer in this framework is modeled by the combination of both single and multilayer kernels in an unsupervised manner. Core vector machine with arc-cosine kernel is used as the final layer classifier which ensure the scalability in this model. The major contribution of this paper is a novel effort to build a deep structured kernel machine architecture similar to deep neural network architecture for classification. It opens up an extendable research avenue for researchers in deep learning based intelligent system leveraging the principles of kernel theory. Experiments show that the proposed method consistently improves the generalization performances of existing deep core vector machine.

DBN- based classification model is proposed in this paper for web spam detection.SMOTE and DAE algorithms is applied in DBN to improve the classification performanceThe content and link feature is combined.The results obtained in this paper is better than the existing systems. With the development of the Internet, the number of web spam increases gradually, which has seriously affected the user experience of search engines. To improve the classification performance of web spam, the deep belief networks (DBN) is used for the first time, and it is effectively combined with the Synthetic Minority Over-Sampling Technique (SMOTE) and De-Noising Auto-Encoder (DAE) algorithm after the multi-aspect research and consideration. After multiple sets of experiments on WEBSPAM-UK2007 dataset, the results show that the classification method proposed in this paper improves the classification performance to a certain extent, which provides a good direction for the future classification of web spam.

Proposed a new sentiment analysis method, based on text-based hidden Markov models, that uses word orders without the need of sentiment lexicons.Proposed an ensemble of text-based hidden Markov models using boosting and clusters of words produced by latent semantic analysis.Showed the method has potential to classify implicit opinions by the proposed ensemble method.Showed better performance in comparison to several previous algorithms in several datasets.Applied it to a real-life dataset to classify paper titles. With the rapid growth of social media, text mining is extensively utilized in practical fields, and opinion mining, also known as sentiment analysis, plays an important role in analyzing opinion and sentiment in texts. Methods in opinion mining generally depend on a sentiment lexicon, which is a set of predefined key words that express sentiment. Opinion mining requires proper sentiment words to be extracted in advance and has difficulty classifying sentences that imply an opinion without using any sentiment key words. This paper presents a new sentiment analysis method, based on text-based hidden Markov models (TextHMMs), for text classification that uses a sequence of words in training texts instead of a predefined sentiment lexicon. We sought to learn text patterns representing sentiment through ensemble TextHMMs. Our method defines hidden variables in TextHMMs by semantic cluster information in consideration of the co-occurrence of words, and thus calculates the sentiment orientation of sentences by fitted TextHMMs. To reflect diverse patterns, we applied an ensemble of TextHMM-based classifiers. In the experiments with a benchmark data set, we show that this method is superior to some existing methods and particularly has potential to classify implicit opinions. We also demonstrate the practicality of the proposed method in a real-life data set of online market reviews.

This paper introduces a novel proposal to discover the best associative classification rules through studying the influence of the attributes used in robust catalogues. Notice that a catalogue is defined as a dataset free of duplicate records. Moreover, a robust catalogue is obtained when incomplete records and those with uncertainty are eliminated from a catalogue. Therefore, a robust catalogue is a collection of association rules with 100% confidence and unitary support. In this paper we demonstrate that robust catalogues contain the same association rules as the datasets from which they were obtained, but can be managed in memory without eliminating any data from the analysis. In fact, the experiments performed show that all robust catalogues contained in a classification dataset are easily obtained, providing millions of associative classification rules with 100% confidence to the expert researcher in data mining.

This paper presents a complete review of computer vision algorithms and vision-based intelligent applications, that are developed in the field of the Unmanned Aerial Vehicles (UAVs) in the latest decade. During this time, the evolution of relevant technologies for UAVs; such as component miniaturization, the increase of computational capabilities, and the evolution of computer vision techniques have allowed an important advance in the development of UAVs technologies and applications. Particularly, computer vision technologies integrated in UAVs allow to develop cutting-edge technologies to cope with aerial perception difficulties; such as visual navigation algorithms, obstacle detection and avoidance and aerial decision-making. All these expert technologies have developed a wide spectrum of application for UAVs, beyond the classic military and defense purposes. Unmanned Aerial Vehicles and Computer Vision are common topics in expert systems, so thanks to the recent advances in perception technologies, modern intelligent applications are developed to enhance autonomous UAV positioning, or automatic algorithms to avoid aerial collisions, among others. Then, the presented survey is based on artificial perception applications that represent important advances in the latest years in the expert system field related to the Unmanned Aerial Vehicles. In this paper, the most significant advances in this field are presented, able to solve fundamental technical limitations; such as visual odometry, obstacle detection, mapping and localization, et cetera. Besides, they have been analyzed based on their capabilities and potential utility. Moreover, the applications and UAVs are divided and categorized according to different criteria. This research is supported by the Spanish Government through the CICYT projects (TRA2015-63708-R and TRA2013-48314-C3-1-R).

Digital pre-assembly process can evaluate flaws in design prior to manufacturing.As these reports are written in free text form, they are not fully utilized.This paper proposes a method of applying text mining techniques to extract insights.The proposed method successfully extracts useful information from the text database. After digitally designing components of vehicles, a design team creates a virtual manufacturing environment that resembles actual manufacturing facilities. During this digital pre-assembly process, a review team examines each component, and records its problems and requirements in part verification reports. Once these reports are delivered to specific design team responsible for each part, the design team can make appropriate adjustments to their designs. This digital pre-assembly process can evaluate and prevent flaws in design prior to actual manufacturing, improving production quality and reducing manufacturing cost. As these reports are written in free text form, they, however, are not fully utilized for understanding problems arising from the design process. This paper proposes a method of applying text mining techniques on verification reports to extract insights for quality improvement. In this paper, following three text mining approaches are proposed: (1) Extracting n-grams for text preprocessing and constructing domain ontology; (2) Extracting meaningful insights from text preprocessing; (3) Creating intuitive visual tools to understand the extracted insights. The proposed method is applied on approximately 140,000 reports, and is validated through the quality of the answers obtained for the questions posed by the domain experts. The proposed method successfully extracts useful information from the text database, and provides intuitive graphical interface, thereby satisfying the need of the domain experts. This paper proposes a systematic framework of transforming huge amount of raw text data into intuitive visualization. Through this framework, meaningful knowledge can be extracted, analyzed and shared to improve the quality of the products. Main contribution of our paper is that it proposes a framework for knowledge extraction from pre-assembly process. Not only does it systematically arrange the data, but it also combines various data sources and creates a knowledge system to improve efficiency of the design process.

The research and practice of information systems have progressed by leaps and bounds due to the emergence of big data analytics and machine learning. The paper undertakes a bibliometric study to analyze the contributions of major authors, universities/organizations, and countries in terms of productivity, citations, and bibliographic coupling. A sample of 2160 articles from the Scopus for the period 2006–2020 is the basis of the study. The publications are grouped into five clusters, of which Cluster 1 is consistently dominant in the information systems publication landscape. Cluster 2 includes published studies on the Internet of Things, security, and cloud computing, which have also been widely researched. Cluster 3, the third-largest cluster, has attempted to investigate social media analytics. Cluster 4 aims to look into the impact of classification and predictive, which is found to have sustained research interest. Topics with scant coverage in terms of papers are primarily in Cluster 5, indicating saturation in the area and the need for conducting inter-disciplinary studies. The results of our study provide valuable insights for potential contributors and global audiences in terms of emerging topics for research.

Due to speckle noise, changes in kidney shape and size between patients, and similar regions, segmenting kidneys in ultrasound images is challenging. To alleviate this challenge, we proposed a novel CNN model, namely multi-scale fusion network of structural features and detailed features (SDFNet), to segment kidneys accurately and robustly. Specifically, the architecture includes structure feature extraction network (S-Net), detail information extraction network (D-Net) and multi-scale fusion block (MCBlock), which are in charge of extracting structural features, capturing texture details and merging features, respectively. In S-Net, we designed a boundary detection (BD) module to obtain more complete kidney structural features. In addition, this paper also designed a step-by-step training mechanism to improve the generalization ability of the SDFNet. We validated the proposed method and compared the same kidney ultrasound dataset with several state-of-the-art methods using six quantitative indicators. The results demonstrate that the proposed approach achieves the best overall performance and outperforms all other approaches on kidney ultrasound image segmentation. It is worth noting that this paper quantitatively analyzes the loss function of segment kidney ultrasound images. This work is a good reference for future research.

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

This paper addresses the problem of how to represent education system measurement definitions and the data used to derive them. ISO 37120 is standard for measuring city performance. It defines 100 indicators of which seven focus on Education. As cities adopt the standard and begin publishing their indicator values, citizens, city bureaucrats and politicians will be able to see how well their education systems perform relative to other cities. Hence, education systems will be subject to greater scrutiny and will have to provide evidence-based explanations for their performance. In order to enable the automated analysis of city performance, four problems must be solved: 1) how are indicator definitions represented? 2) how is the data used to derive an indicator value represented? 3) how is educational system specific knowledge represented, and 4) how is city specific educational system knowledge represented? In this paper we present an Education Ontology designed to represent ISO 37120 education indicators and the information delineated above. The ontology is designed to enable an intelligent agent to perform consistency and root cause analysis of city indicators. It can also be used by cities to publish their education indicators and data, using Semantic Web standards, on their Open Data portals.

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

The variety and plethora of research papers available on the Web motivated researchers to propose models that could assist users with personalized citation recommendations. In recent years, citation recommendation models using Network Representation Learning (NRL) methods have shown promising results. Nevertheless, existing NRL-based models are limited in terms of exploiting semantic relations and contextual information between the objects of bibliographic papers’ networks. Additionally, these models cannot adequately explore the structure of heterogeneous information networks, topical relevance, and relevant semantics. Consequently, they suffer from network sparsity and inadequate personalization problems. To overcome these shortcomings, we present a network embedding model termed as Global Citation Recommendation employing Generative Adversarial Network (GCR-GAN). The proposed model exploits the Heterogeneous Bibliographic Network (HBN) to generate personalized citation recommendations. In particular, the proposed model utilizes semantic relations corresponding to the objects of the heterogeneous bibliographic network and captures network structure proximity employing the Scientific Paper Embeddings using Citation-informed Transformers (SPECTER) and Denoising Auto-encoder networks to learn semantic-preserving graph representations. Compared to baseline models, the recommendations generated by our model over the DBLP and ACM datasets prove that it outperforms baseline methods by gaining almost 11% and 12% improvement in terms of Mean Average Precision (MAP) and Normalized Discounted Cumulative Gain (nDCG) metrics, respectively. Furthermore, we analyzed the effectiveness of the proposed model considering network sparsity issue, where our model gains almost 7% better recall@100 score against the second-best counterpart.

In the Authorship Attribution (AA) task, the most likely author of textual documents, such as books, papers, news, and text messages and posts are identified using statistical and computational methods. In this paper, a new computational approach is presented for identifying the most likely author of text documents. The proposed solution emphasizes lazy profile-based classification and, by using the Term Frequency-Inverse Document Frequency (TF_IDF) scheme, introduces a new measure for identifying important terms of documents. The importance of the terms is then used to calculate the similarity between an anonymous document and known documents. The proposed solution works with raw text documents and does not require any NLP tools for preprocessing, which makes it language-independent. The efficiency of the proposed solution has been evaluated by conducting several experiments on two English and Persian datasets, each of which contains six corpora with different number of authors. The obtained results demonstrate that the proposed solution outperforms state-of-the-art stylometric features, employed by seven well-known classifiers, by obtaining 0.902 accuracy for the English dataset and 0.931 accuracy for the Persian dataset. In addition, supplementary experiments have been conducted to evaluate the effects of documents’ length on the accuracy of the proposed solution, to examine the computation time of the proposed solution and competitive classifiers, and to identify the most effective stylometric features and classifiers.

Crowdsourcing as an important computing resource for the Crowd-based Cooperative, crowdsourcing workers, due to the complexity of their personnel composition and the ambiguity of group characteristics, make it difficult to accurately recommend suitable worker groups for the task. Recommending crowdsourcing tasks to suitable workers can greatly improve the efficiency and quality of the execution of crowdsourcing tasks. The current crowdsourcing recommendation algorithm is based on the single characteristics of the workers, ignoring the multi-dimensional characteristics of the workers and the community characteristics of the crowd. This paper proposes a worker group recommendation method based on multi-community collaboration (GRMBC) by utilizing the worker characteristics information extracted from crowdsourcing platform. Based on the characteristics of workers'reputation, preference and activity, the method divides the worker group into several characteristics communities with similar behavior to discover the potential multi-community structure in the crowdsourcing worker group, and then selects Top-N worker group for recommendation through the interaction among multi-communities. At the same time, we also proposed two mitigation strategies for the cold start problem of data in crowdsourcing. This paper uses the public data collected by AMT to do the experiments, and compares the aggregation results of the recommendations generated by different algorithms. The results show the recommendations generated by the GRBMC algorithm proposed in this paper performs the best comprehensively. When the GRBMC algorithm that considers both worker attributes and communi-ty characteristics has an accuracy improvement of 0.03 ~ 0.04 compared with not using the recommendation algorithm on each index, the accuracy of 0.01 ~ 0.02 is improved com-pared with the method considering single characteristic. Moreover, compared with the individual recommendation method of the workers, the recommendation method of the workers' group is more in line with the platform requirements, and can well reflect the wisdom of crowd wisdom.

Speaker Identification (SI) is the process of identifying the speaker from a given utterance by comparing the voice biometrics of the utterance with those utterance models stored beforehand. SI technologies are taken a new direction due to the advances in artificial intelligence and have been used widely in various domains. Feature extraction is one of the most important aspects of SI, which significantly influences the SI process and performance. This systematic review is conducted to identify, compare, and analyze various feature extraction approaches, methods, and algorithms of SI to provide a reference on feature extraction approaches for SI applications and future studies. The review was conducted according to Kitchenham systematic review methodology and guidelines, and provides an in-depth analysis on proposals and implementations of SI feature extraction methods discussed in the literature between year 2011 and 2106. Three research questions were determined and an initial set of 535 publications were identified to answer the questions. After applying exclusion criteria 160 related publications were shortlisted and reviewed in this paper; these papers were considered to answer the research questions. Results indicate that pure Mel-Frequency Cepstral Coefficients (MFCCs) based feature extraction approaches have been used more than any other approach. Furthermore, other MFCC variations, such as MFCC fusion and cleansing approaches, are proven to be very popular as well. This study identified that the current SI research trend is to develop a robust universal SI framework to address the important problems of SI such as adaptability, complexity, multi-lingual recognition, and noise robustness. The results presented in this research are based on past publications, citations, and number of implementations with citations being most relevant. This paper also presents the general process of SI.