Search

ChatGPT, a recently developed product by openAI, is successfully leaving its mark as a multi-purpose natural language based chatbot. In this paper, we are more interested in analyzing its potential in the field of computational biology. A major share of work done by computational biologists these days involve coding up bioinformatics algorithms, analyzing data, creating pipelining scripts and even machine learning modeling and feature extraction. This paper focuses on the potential influence (both positive and negative) of ChatGPT in the mentioned aspects with illustrative examples from different perspectives. Compared to other fields of computer science, computational biology has (1) less coding resources, (2) more sensitivity and bias issues (deals with medical data), and (3) more necessity of coding assistance (people from diverse background come to this field). Keeping such issues in mind, we cover use cases such as code writing, reviewing, debugging, converting, refactoring, and pipelining using ChatGPT from the perspective of computational biologists in this paper. [ABSTRACT FROM AUTHOR]

Nowadays, there has been a rapidly increasing number of scientific submissions in multiple research domains. A large number of journals have various acceptance rates, impact factors, and rankings in different publishers. It becomes time-consuming for many researchers to select the most suitable journal to submit their work with the highest acceptance rate. A paper submission recommendation system is more critical for the research community and publishers as it gives scientists another support to complete their submission conveniently. This paper investigates the submission recommendation system for two main research topics: computer science and applied mathematics. Unlike the previous works (Wang et al., 2018; Son et al., 2020) that extract TF–IDF and statistical features as well as utilize numerous machine learning algorithms (logistics regression and multiple perceptrons) for building the recommendation engine, we present an efficient paper submission recommendation algorithm by using different bidirectional transformer encoders and the Mixture of Transformer Encoders technique. We compare the performance between our methodology and other approaches by one dataset from Wang et al. (2018) with 14012 papers in computer science and another dataset collected by us with 223,782 articles in 178 Springer applied mathematics journals in terms of top K accuracy (K = 1 , 3 , 5 , 10). The experimental results show that our proposed method extensively outperforms other state-of-the-art techniques with a significant margin in all top K accuracy for both two datasets. We publish all datasets collected and our implementation codes for further references. 1 1 https://github.com/BinhMisfit/PSRMTE. • Bidirectional transformer encoders can improve the performance of the paper submission recommendation system. • The Mixture of Transformer Encoders framework shows the efficiency in the paper submission recommendation problem. • Proposed techniques can surpass other recent techniques on two datasets related. [ABSTRACT FROM AUTHOR]

The increasing demand for mobility in our society poses various challenges to traffic engineering, computer science in general, and artificial intelligence in particular. Increasing the capacity of road networks is not always possible, thus a more efficient use of the available transportation infrastructure is required. Another issue is that many problems in traffic management and control are inherently decentralized and/or require adaptation to the traffic situation. Hence, there is a close relationship to multiagent reinforcement learning. However, using reinforcement learning poses the challenge that the state space is normally large and continuous, thus it is necessary to find appropriate schemes to deal with discretization of the state space. To address these issues, a multiagent system with agents learning independently via a learning algorithm was proposed, which is based on estimating Q-values from k-nearest neighbors. In the present paper, we extend this approach and include transfer of experiences among the agents, especially when an agent does not have a good set of k experiences. We deal with traffic signal control, running experiments on a traffic network in which we vary the traffic situation along time, and compare our approach to two baselines (one involving reinforcement learning and one based on fixed times). Our results show that the extended method pays off when an agent returns to an already experienced traffic situation. [ABSTRACT FROM AUTHOR]

With the increase interest and number of the users in Social media, the file handling has also increased. To manage the load, cloud servers are being used by the service providers. To identify and cluster file is a difficult task that is important in the domain of computer science. Various traditional approaches for identification exists that uses design features. The problem with these methods is get that they can be easily spoofed. To resolve the issue, in this paper, a hybrid algorithm combining the features of Random Forest with AdaBoost is proposed. The algorithm Internet of Thing (IoT) data file formatting (IDFF) classifies data as (text, image, audio and video) and gives better accuracy. Our proposed research obtains better Accuracy (93%), Precision (95%), Recall (95%), F-Measure (95%), and G-Mean (96%). [ABSTRACT FROM AUTHOR]

The integration of biology, computer science, and statistics has given rise to the interdisciplinary field of bioinformatics, which aims to decode biological intricacies. It produces extensive and diverse features, presenting an enormous challenge in classifying bioinformatic problems. Therefore, an intelligent bioinformatics classification system must select the most relevant features to enhance machine learning performance. This paper proposes a feature selection model based on the fractal concept to improve the performance of intelligent systems in classifying high-dimensional biological problems. The proposed fractal feature selection (FFS) model divides features into blocks, measures the similarity between blocks using root mean square error (RMSE), and determines the importance of features based on low RMSE. The proposed FFS is tested and evaluated over ten high-dimensional bioinformatics datasets. The experiment results showed that the model significantly improved machine learning accuracy. The average accuracy rate was 79% with full features in machine learning algorithms, while FFS delivered promising results with an accuracy rate of 94%. [ABSTRACT FROM AUTHOR]

The evaluation of scientific journals poses challenges owing to the existence of various impact measures. This is because journal ranking is a multidimensional construct that may not be assessed effectively using a single metric such as an impact factor. A few studies have proposed an ensemble of metrics to prevent the bias induced by an individual metric. In this study, a multi-metric journal ranking method based on the standardized average index (SA index) was adopted to develop an extended standardized average index (ESA index). The ESA index utilizes six metrics: the CiteScore, Source Normalized Impact per Paper (SNIP), SCImago Journal Rank (SJR), Hirsh index (H-index), Eigenfactor Score, and Journal Impact Factor from three well-known databases (Scopus, SCImago Journal & Country Rank, and Web of Science). Experiments were conducted in two computer science subject areas: (1) artificial intelligence and (2) computer vision and pattern recognition. Comparing the results of the multi-metric-based journal ranking system with the SA index, it was demonstrated that the multi-metric ESA index exhibited high correlation with all other indicators and significantly outperformed the SA index. To further evaluate the performance of the model and determine the aggregate impact of bibliometric indices with the ESA index, we employed unsupervised machine learning techniques such as clustering coupled with principal component analysis (PCA) and t-distributed stochastic neighbor embedding (t-SNE). These techniques were utilized to measure the clustering impact of various bibliometric indicators on both the complete set of bibliometric features and the reduced set of features. Furthermore, the results of the ESA index were compared with those of other ranking systems, including the internationally recognized Scopus, SJR, and HEC Journal Recognition System (HJRS) used in Pakistan. These comparisons demonstrated that the multi-metric-based ESA index can serve as a valuable reference for publishers, journal editors, researchers, policymakers, librarians, and practitioners in journal selection, decision making, and professional assessment. [ABSTRACT FROM AUTHOR]

The new way of thinking science from Newtonian determinism to nonlinear unpredictability and the dawn of advanced computer science and technology can be summarized in the words of the theoretical physicist Michel Baranger, who, in 2000, said in a conference: "Twenty-first-century theoretical physics is coming out of the chaos revolution; it will be about complexity and its principal tool will be the computer.". This can be extended to natural sciences in general. Modelling and predicting ionosphere variables have been considered since many decades as a paramount objective of research by scientists and engineers. The new approach to natural sciences influenced also ionosphere research. Ionosphere as a part of the solar–terrestrial environment is recognized to be a complex chaotic system, and its study under this new way of thinking should become an important area of ionospheric research. After discussing the new context, this paper will try to review recent advances in the exploration of ionosphere parameter time series in terms of chaos theory and the use of machine-learning algorithms. [ABSTRACT FROM AUTHOR]

Automated generation of image captions is a demanding AI crisis as it necessitates the exploitation of numerous methods from diverse computer science fields. Deep learning (DL) approaches have revealed marvelous results in a lot of diverse appliances. On the other hand, data augmentation in DL that imitates the quantity and the variety of training data without the need of gathering additional data is a hopeful area in machine learning (ML). Producing textual descriptions for a specified image is a demanding task using the computer. This survey makes a critical analysis of about 65 papers regarding image captioning. More particularly, varied performance measures that are contributed in diverse articles are analyzed. In addition, a comprehensive study is made regarding the maximal performances and varied features deployed in each work. Moreover, chronological analysis and dataset analysis are done and finally, the survey extends with the determination of varied research challenges, which might be productive for the analysts to endorse enhanced upcoming works on image captioning. [ABSTRACT FROM AUTHOR]

Coauthorship prediction applies predictive analytics to bibliographic data to predict authors who are highly likely to be coauthors. In this study, we propose an approach for coauthorship prediction based on bibliographic network embedding through a graph‐based bibliographic data model that can be used to model common bibliographic data, including papers, terms, sources, authors, departments, research interests, universities, and countries. A real‐world dataset released by AMiner that includes more than 2 million papers, 8 million citations, and 1.7 million authors were integrated into a large bibliographic network using the proposed bibliographic data model. Translation‐based methods were applied to the entities and relationships to generate their low‐dimensional embeddings while preserving their connectivity information in the original bibliographic network. We applied machine learning algorithms to embeddings that represent the coauthorship relationships of the two authors and achieved high prediction results. The reference model, which is the combination of a network embedding size of 100, the most basic translation‐based method, and a gradient boosting method achieved an F1 score of 0.9 and even higher scores are obtainable with different embedding sizes and more advanced embedding methods. Thus, the strengths of the proposed approach lie in its customizable components under a unified framework. [ABSTRACT FROM AUTHOR]

Entropy and extropy are emerging concepts in machine learning and computer science. Within the past decade, statisticians have created estimators for these measures. However, associated variability metrics, specifically varentropy and varextropy, have received comparably less attention. This paper presents a novel methodology for computing varentropy and varextropy, drawing inspiration from Bayesian nonparametric methods. We implement this approach using a computational algorithm in R and demonstrate its effectiveness across various examples. Furthermore, these new estimators are applied to test uniformity in data. [ABSTRACT FROM AUTHOR]

Regularization regression learning scheme finds its powerful applications in many areas, such as Computer science, manufacturing engineering, economic decision making, etc. In this paper, the indefinite kernel based coefficient dependent regularization algorithm for block-wise streaming data is proposed, and learning performance of this algorithm is studied by bounding the learning error. Our learning scheme works in an online and weighted average manner. The total error is decomposed into weighted average of local variance error and weighted average of local bias error. By the kernel decompose and integral operator method, satisfied error bound and learning rates are derived. Our error analysis shows that mild growth of the sizes of data block and the underregularization strategy can guarantee the convergence of the learning scheme. [ABSTRACT FROM AUTHOR]

With the application of machine learning rapidly gaining popularity in computer science and other fields, neural network techniques have successfully simulated the performance of in-service pavements as they are efficient in predicting and solving nonlinear relationships and in dealing with uncertain large-area pavement problems. In this paper, we address the problem of the optimal timing of preventive maintenance of asphalt pavements to accurately predict the condition index (pavement condition index, PCI) of highway asphalt pavements and develop a highly accurate, long-period, multifactor prediction model with the suitability of preventive maintenance at its core. The prediction model is called differential evolution particle swarm optimization back propagation (DEPSO-BP) neural network, and the input dimension of the prediction model is determined by gray correlation analysis (GCA), and DEPSO is used to improve the search efficiency of BP neural network and the asphalt pavement usage performance with parameter continuity prediction model. Finally, the Qinglan Highway (G22) PCI of Gansu Province, China, is selected for example validation, and the prediction results are compared with those of the four models. The results show that the multifactor prediction model based on DEPSO-BP neural network has good generalization ability. This model is important for improving the economic efficiency of road maintenance, and can be used in the long-cycle process to provide model reference and scientific basis for the subsequent road maintenance budget application and decision-making scheme. [ABSTRACT FROM AUTHOR]

Statistical information theory is a method for quantifying the amount of stochastic uncertainty in a system. This theory originated in communication theory. The application of information theoretic approaches has been extended to different fields. This paper aims to perform a bibliometric analysis of information theoretic publications listed on the Scopus database. The data of 3701 documents were extracted from the Scopus database. The software used for analysis includes Harzing's Publish or Perish and VOSviewer. Results including publication growth, subject areas, geographical contributions, country co-authorship, most cited publications, keyword co-occurrence analysis, and citation metrics are presented in this paper. Publication growth has been steady since 2003. The United States has the highest number of publications and received more than half of the total citations from all 3701 publications. Most of the publications are in computer science, engineering, and mathematics. The United States, the United Kingdom, and China have the highest collaboration across countries. The focus on information theoretic is slowly shifting from mathematical models to technology-driven applications such as machine learning and robotics. This study highlights the trends and developments of information theoretic publications, which helps researchers to understand the state of the art of information theoretic approaches for future contributions in this research domain. [ABSTRACT FROM AUTHOR]

Many network/graph structures are continuously monitored by various sensors that are placed at a subset of nodes and edges. The multidimensional data collected from these sensors over time create large-scale graph data in which the data points are highly dependent. Monitoring large-scale attributed networks with thousands of nodes and heterogeneous sensor data to detect anomalies and unusual events is a complex and computationally expensive process. This paper introduces a new generic approach inspired by state-space models for network anomaly detection that can utilize the information from the network topology, the node attributes (sensor data), and the anomaly propagation sets in an integrated manner to analyze the entire network all at once. This article presents how heterogeneous network sensor data can be analyzed to locate the sources of anomalies as well as the anomalous regions in a network, which can be impacted by one or multiple anomalies at any time instance. Experimental results demonstrate the superior performance of our proposed framework in detecting anomalies in attributed graphs. Summary of Contribution: With the increasing availability of large-scale network sensors and rapid advances in artificial intelligence methods, fundamentally new analytical tools are needed that can integrate data collected from sensors across the networks for decision making while taking into account the stochastic and topological dependencies between nodes, sensors, and anomalies. This paper develops a framework to intelligently and efficiently analyze complex and highly dependent data collected from disparate sensors across large-scale network/graph structures to detect anomalies and abnormal behavior in real time. Unlike general purpose (often black-box) machine learning models, this paper proposes a unique framework for network/graph structures that incorporates the complexities of networks and interdependencies between network entities and sensors. Because of the multidisciplinary nature of the paper that involves optimization, machine learning, and system monitoring and control, it can help researchers in both operations research and computer science domains to develop new network-specific computing tools and machine learning frameworks to efficiently manage large-scale network data. [ABSTRACT FROM AUTHOR]

"Multi-agent systems (MAS)" have been extensively studied across various fields, including robotics, economics, biology, and computer science. A distinctive feature of these systems is the ability of multiple agents, each with different characteristics, to perform system-wide tasks through local bottom-up interactions. Furthermore, design and control methods for system networks based on graph theory are being developed. Recent applications of these methods include autonomous driving technology, smart grids, and understanding social systems. This special issue aims to deepen the understanding of MAS, focusing on their control and applications. It features 16 papers, including one review paper. The accepted papers cover a wide range of topics, including reinforcement learning, autonomous mobility systems, and machine learning, presenting the latest research findings on MAS. These studies provide valuable insights into various aspects and potential applications of MAS. We hope that this issue will be beneficial to our readers and contribute to the advancement of future research. [ABSTRACT FROM AUTHOR]

The characterisation of geometric shapes produces their concise description and is, therefore, important for subsequent analyses, for example in Computer Vision, Machine Learning, or shape matching. A new method for extracting characterisation vectors of 2D geometric shapes is proposed in this paper. The shape of interest, embedded into a raster space, is swept several times by sweep-lines having different slopes. The interior shape's points, being in the middle of its boundary and laying on the actual sweep-line, are identified at each stage of the sweeping process. The midpoints are then connected iteratively into chains. The chains are filtered, vectorised, and normalised. The obtained polylines from the vectorisation step are used to design the shape's characterisation vector for further application-specific analyses. The proposed method was verified on numerous shapes, where single- and multi-threaded implementations were compared. Finally, characterisation vectors, among which some were rotated and scaled, were determined for these shapes. The proposed method demonstrated a good rotation- and scaling-invariant identification of equal shapes. [ABSTRACT FROM AUTHOR]

Agro-business is highly dependent on rice quality and its protection from diseases. There are several prerequisites for the procedures and the strategies that are productive and efficient for expanding the harvest yield. The advancement in computer science has supported various domains; agricultural innovation is one of them. The apparatuses which utilize the strategies of advanced artificial intelligence and machine learning have been featured in this paper. These techniques attain abnormally productive outcomes for the recognition of infections engrossing the images of leaves, fields of harvest, or seeds. In this context, this work presents a survey that focuses on accuracy agribusiness for expanding the conception of rice, which is one of the main harvests on the planet. In this paper, the overview and examination of various papers distributed in the most recent eight years with various methodologies identified with crop diseases identification, the health of seedlings, and quality of grain have been introduced. Experiments are performed for knowledge extraction using Web of Science and Scopus databases to analyze research trends in the domain of rice disease identification using artificial intelligence using global analysis, year-wise and country-wise citations, and so on to support various researchers working in this domain. [ABSTRACT FROM AUTHOR]

The field of statistical computing is rapidly developing and evolving. Shifting away from the formerly siloed landscape of mathematics, statistics, and computer science, recent advancements in statistical computing are largely characterized by a fusing of these worlds; namely, programming, software development, and applied statistics are merging in new and exciting ways. There are numerous drivers behind this advancement, including open movement (encompassing development, science, and access), the advent of data science as a field, and collaborative problem-solving, as well as practice-altering advances in subfields such as artificial intelligence, machine learning, and Bayesian estimation. In this paper, we trace this shift in how modern statistical computing is performed, and that which has recently emerged from it. This discussion points to a future of boundless potential for the field. [ABSTRACT FROM AUTHOR]

Plant phenotyping studies the complex characteristics of plants, with the aim of evaluating and assessing their condition and finding better exemplars. Recently, a new branch emerged in the phenotyping field, namely, high-throughput phenotyping (HTP). Specifically, HTP exploits modern data sampling techniques to gather a high amount of data that can be used to improve the effectiveness of phenotyping. Hence, HTP combines the knowledge derived from the phenotyping domain with computer science, engineering, and data analysis techniques. In this scenario, machine learning (ML) and deep learning (DL) algorithms have been successfully integrated with noninvasive imaging techniques, playing a key role in automation, standardization, and quantitative data analysis. This study aims to systematically review two main areas of interest for HTP: hardware and software. For each of these areas, two influential factors were identified: for hardware, platforms and sensing equipment were analyzed; for software, the focus was on algorithms and new trends. The study was conducted following the PRISMA protocol, which allowed the refinement of the research on a wide selection of papers by extracting a meaningful dataset of 32 articles of interest. The analysis highlighted the diffusion of ground platforms, which were used in about 47% of reviewed methods, and RGB sensors, mainly due to their competitive costs, high compatibility, and versatility. Furthermore, DL-based algorithms accounted for the larger share (about 69%) of reviewed approaches, mainly due to their effectiveness and the focus posed by the scientific community over the last few years. Future research will focus on improving DL models to better handle hardware-generated data. The final aim is to create integrated, user-friendly, and scalable tools that can be directly deployed and used on the field to improve the overall crop yield. [ABSTRACT FROM AUTHOR]

Based on the analysis of data we observe that the share of single-authored papers was significantly high in theoretical computer science, while collaborative efforts dominate computer science system research like PL, AI, ML, etc. Collaborative authorship is higher in journals over conferences. Further, values of collaborative indicators are also high for journals except for the Machine Learning (ML) subfield. In addition, the author distribution patterns are different for conferences and journals. The findings also exhibited diversity in authorship trends across sub-fields of CS research. Our results show collaboration trends in conferences and journals of major CS subfields. Such collaborative patterns benefit the funding agency, policymakers, scientific community, and researchers to plan and execute their research. [ABSTRACT FROM AUTHOR]

Automated Driving Systems (ADS) open up a new domain for the automotive industry and offer new possibilities for future transportation with higher efficiency and comfortable experiences. However, perception and sensing for autonomous driving under adverse weather conditions have been the problem that keeps autonomous vehicles (AVs) from going to higher autonomy for a long time. This paper assesses the influences and challenges that weather brings to ADS sensors in a systematic way, and surveys the solutions against inclement weather conditions. State-of-the-art algorithms and deep learning methods on perception enhancement with regard to each kind of weather, weather status classification, and remote sensing are thoroughly reported. Sensor fusion solutions, weather conditions coverage in currently available datasets, simulators, and experimental facilities are categorized. Additionally, potential ADS sensor candidates and developing research directions such as V2X (Vehicle to Everything) technologies are discussed. By looking into all kinds of major weather problems, and reviewing both sensor and computer science solutions in recent years, this survey points out the main moving trends of adverse weather problems in perception and sensing, i.e., advanced sensor fusion and more sophisticated machine learning techniques; and also the limitations brought by emerging 1550 nm LiDARs. In general, this work contributes a holistic overview of the obstacles and directions of perception and sensing research development in terms of adverse weather conditions. [ABSTRACT FROM AUTHOR]

A way to improve energy management is to perform balancing both at the Peer-to-peer (P2P) level and then at the Virtual Microgrid-to-Virtual Microgrid (VMG2VMG) level, while considering the intermittency of available Renewable Energy Source (RES). This paper proposes an interdisciplinary analytics-based approach for the formation of VMGs addressing energy balancing. Our approach incorporates Computer Science methods to address an Energy sector problem, utilizing data preprocessing techniques and Machine Learning concepts. It features P2P balancing, where each peer is a prosumer perceived as an individual entity, and Virtual Microgrids (VMGs) as clusters of peers. We conducted several simulations utilizing clustering and binning algorithms for preprocessing energy data. Our approach offers options for generating VMGs of prosumers, prior to using a customized Exhaustive brute-force Balancing Algorithm (EBA). EBA performs balancing at the cluster-to-cluster level, perceived as VMG2VMG balancing. To that end, the study simulates on data from 94 prosumers, and reports outcomes, biases, and prospects for scaling up and expanding this work. Finally, this paper outlines potential ideal usages for the approach, either standalone or integrated with other toolkits and technologies. [ABSTRACT FROM AUTHOR]

A coreset of an input set is its small summarization, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the original (full) set, for a given family of problems (models/classifiers/loss functions). Coresets have been suggested for many fundamental problems, for example, in machine/deep learning, computer vision, databases, and theoretical computer science. This introductory paper was written following requests regarding the many inconsistent coreset definitions, lack of source code, the required deep theoretical background from different fields, and the dense papers that make it hard for beginners to apply and develop coresets. The article provides folklore, classic, and simple results including step‐by‐step proofs and figures, for the simplest (accurate) coresets. Nevertheless, we did not find most of their constructions in the literature. Moreover, we expect that putting them together in a retrospective context would help the reader to grasp current results that usually generalize these fundamental observations. Experts might appreciate the unified notation and comparison table for existing results. Open source code is provided for all presented algorithms, to demonstrate their usage, and to support the readers who are more familiar with programming than mathematics. This article is categorized under:Algorithmic Development > Structure DiscoveryFundamental Concepts of Data and Knowledge > Big Data MiningTechnologies > Machine Learning [ABSTRACT FROM AUTHOR]

Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning, especially graph neural networks (GNNs), as a key building block for combinatorial tasks, either directly as solvers or by enhancing exact solvers. The inductive bias of GNNs effectively encodes combinatorial and relational input due to their invariance to permutations and awareness of input sparsity. This paper presents a conceptual review of recent key advancements in this emerging field, aiming at optimization and machine learning researchers. [ABSTRACT FROM AUTHOR]

Laser-plasma physics has developed rapidly over the past few decades as lasers have become both more powerful and more widely available. Early experimental and numerical research in this field was dominated by single-shot experiments with limited parameter exploration. However, recent technological improvements make it possible to gather data for hundreds or thousands of different settings in both experiments and simulations. This has sparked interest in using advanced techniques from mathematics, statistics and computer science to deal with, and benefit from, big data. At the same time, sophisticated modeling techniques also provide new ways for researchers to deal effectively with situation where still only sparse data are available. This paper aims to present an overview of relevant machine learning methods with focus on applicability to laser-plasma physics and its important sub-fields of laser-plasma acceleration and inertial confinement fusion. [ABSTRACT FROM AUTHOR]

Electrical utilities and system operators (SOs) are constantly looking for solutions to problems in the management and control of the power network. For this purpose, SOs are exploring new research fields, which might bring contributions to the power system environment. A clear example is the field of computer science, within which artificial intelligence (AI) has been developed and is being applied to many fields. In power systems, AI could support the fault prediction of cable joints. Despite the availability of many legacy methods described in the literature, fault prediction is still critical, and it needs new solutions. For this purpose, in this paper, the authors made a further step in the evaluation of machine learning methods (ML) for cable joint health assessment. Six ML algorithms have been compared and assessed on a consolidated test scenario. It simulates a distributed measurement system which collects measurements from medium-voltage (MV) cable joints. Typical metrics have been applied to compare the performance of the algorithms. The analysis is then completed considering the actual in-field conditions and the SOs' requirements. The results demonstrate: (i) the pros and cons of each algorithm; (ii) the best-performing algorithm; (iii) the possible benefits from the implementation of ML algorithms. [ABSTRACT FROM AUTHOR]

Recent advances in network representation learning have enabled significant improvement in the link prediction task, which is at the core of many downstream applications. As an increasing amount of mobility data become available because of the development of location-based technologies, we argue that this resourceful mobility data can be used to improve link prediction tasks. In this paper, we propose a novel link prediction framework that utilizes user offline check-in behavior combined with user online social relations. We model user offline location preference via a probabilistic factor model and represent user social relations using neural network representation learning. To capture the interrelationship of these two sources, we develop an anchor link method to align these two different user latent representations. Furthermore, we employ locality-sensitive hashing to project the aggregated user representation into a binary matrix, which not only preserves the data structure but also improves the efficiency of convolutional network learning. By comparing with several baseline methods that solely rely on social networks or mobility data, we show that our unified approach significantly improves the link prediction performance. Summary of Contribution: This paper proposes a novel framework that utilizes both user offline and online behavior for social link prediction by developing several machine learning algorithms, such as probabilistic factor model, neural network embedding, anchor link model, and locality-sensitive hashing. The scope and mission has the following aspects: (1) We develop a data and knowledge modeling approach that demonstrates significant performance improvement. (2) Our method can efficiently manage large-scale data. (3) We conduct rigorous experiments on real-world data sets and empirically show the effectiveness and the efficiency of our proposed method. Overall, our paper can contribute to the advancement of social link prediction, which can spur many downstream applications in information systems and computer science. [ABSTRACT FROM AUTHOR]

Keeping railway tracks in good operational condition is one of the most important tasks for railway owners. As a result, railway companies have to conduct track inspections periodically, which is costly and time-consuming. Due to the rapid development in computer science, many prediction models using machine learning methods have been developed. It is possible to discover the degradation pattern and develop accurate prediction models. The paper reviews the existing prediction methods for railway track degradation, including traditional methods and prediction methods based on machine learning methods, including probabilistic methods, Artificial Neural Network (ANN), Support Vector Machine (SVM), and Grey Model (GM). The advantages, shortage, and applicability of methods are discussed, and recommendations for further research are provided. [ABSTRACT FROM AUTHOR]

The eight papers included in this special issue represent a selection of extended contributions presented at the 17th International Conference on Soft Computing Models in Industrial and Environmental Applications, SOCO 2022 held in Salamanca, Spain, September 6th-8th, 2022, and organized by the BISITE group at University of Salamanca. SOCO 2022 international conference represents a collection or set of computational techniques in machine learning, computer science and some engineering disciplines which investigate, simulate, and analyse very complex issues and phenomena. This special issue is aimed at practitioners, researchers, and postgraduate students who are engaged in developing and applying advanced intelligent systems principles to solve real-world problems in the mentioned fields. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of sampling from a graphical model when the model itself is changing dynamically with time. This problem derives its interest from a variety of inference, learning, and sampling settings in machine learning, computer vision, statistical physics, and theoretical computer science. While the problem of sampling from a static graphical model has received considerable attention, theoretical works for its dynamic variants have been largely lacking. The main contribution of this paper is an algorithm that can sample dynamically from a broad class of graphical models over discrete random variables. Our algorithm is parallel and Las Vegas: it knows when to stop, and it outputs samples from the exact distribution. We also provide sufficient conditions under which this algorithm runs in time proportional to the size of the update on general graphical models as well as well-studied specific spin systems. In particular we obtain, for the Ising model (ferromagnetic or antiferromagnetic) and for the hardcore model the first dynamic sampling algorithms that can handle both edge and vertex updates (addition, deletion, and change of functions). The algorithms for both these models are efficient within regimes that are close to the respective uniqueness regimes, beyond which, even for the static and approximate sampling, no local algorithms were known or the problem itself is intractable. Our dynamic sampling algorithm relies on a local resampling algorithm and a new "equilibrium" property that is shown to be satisfied by our algorithm at each step and enables us to prove its correctness. This equilibrium property is robust enough to guarantee the correctness of our algorithm, helps us improve bounds on fast convergence on specific models, and should be of independent interest. [ABSTRACT FROM AUTHOR]

This paper explores a series of thoughts about the meaning of intelligence in neuroscience and computer science. This work aims to present an understandable definition that fits our contemporary artificial intelligence background. The research methodology of this essay lies in existing theories of artificial intelligence, focused on computer science and neuroscience. I analyze the relationship between intelligence and neuroscience and Hawkin's Thousand Brains Theory, an approach to show what it is an intelligent agent according to neuroscience. Here, the main result relies on the verification that intelligence is only possible in the neocortex. According to this result, the study performs a second critical analysis aiming to demonstrate why there is no artificial intelligence today. [ABSTRACT FROM AUTHOR]

Capturing long-range dependencies during feature extraction is crucial for video-based person re-identification (re-id) since it would help to tackle many challenging problems such as occlusion and dramatic pose variation. Moreover, capturing subtle differences, such as bags and glasses, is indispensable to distinguish similar pedestrians. In this paper, we propose a novel and efficacious Statistic Attention (SA) block which can capture both the long-range dependencies and subtle differences. SA block leverages high-order statistics of feature maps, which contain both long-range and high-order information. By modeling relations with these statistics, SA block can explicitly capture long-range dependencies with less time complexity. In addition, high-order statistics usually concentrate on details of feature maps and can perceive the subtle differences between pedestrians. In this way, SA block is capable of discriminating pedestrians with subtle differences. Furthermore, this lightweight block can be conveniently inserted into existing deep neural networks at any depth to form Statistic Attention Network (SANet). To evaluate its performance, we conduct extensive experiments on two challenging video re-id datasets, showing that our SANet outperforms the state-of-the-art methods. Furthermore, to show the generalizability of SANet, we evaluate it on three image re-id datasets and two more general image classification datasets, including ImageNet. The source code is available at http://vipl.ict.ac.cn/resources/codes/code/SANet_code.zip. [ABSTRACT FROM AUTHOR]

A novel assessment method for rapid structural safety state assessment is developed based on state-of-the-art machine learning technology. In this paper, a deep neural network (DNN), which originated in computer science, is first introduced, including its concept, structure and related training algorithms. Then the evaluation procedure to determine the structural safety state based on the DNN is developed. In the procedure, the pseudo-acceleration spectra and the structural safety states are selected as the input and output of the DNN model, respectively. Finally, the procedure of the novel assessment method is illustrated using a five-story reinforced concrete (RC) frame as an example. The effectiveness and accuracy are validated, and the influence of the number of hidden layers and size of the training data on the performance of the DDN is also investigated. The results demonstrate that the proposed method can evaluate the structural safety state rapidly based on the DNN. The most appropriate number of hidden layers is two considering both training accuracy and test accuracy. The training accuracy and test accuracy were 93.45% and 93.14%, respectively, using the two-hidden-layer DNN model trained on a training dataset of size 66,612. [ABSTRACT FROM AUTHOR]

Information-theoretic quantities like entropy and mutual information have found numerous uses in machine learning. It is well known that there is a strong connection between these entropic quantities and submodularity since entropy over a set of random variables is submodular. In this paper, we study combinatorial information measures that generalize independence, (conditional) entropy, (conditional) mutual information, and total correlation defined over sets of (not necessarily random) variables. These measures strictly generalize the corresponding entropic measures since they are all parameterized via submodular functions that themselves strictly generalize entropy. Critically, we show that, unlike entropic mutual information in general, the submodular mutual information is actually submodular in one argument, holding the other fixed, for a large class of submodular functions whose third-order partial derivatives satisfy a non-negativity property. This turns out to include a number of practically useful cases such as the facility location and set-cover functions. We study specific instantiations of the submodular information measures on these, as well as the probabilistic coverage, graph-cut, log-determinants, and saturated coverage functions and see that they all have mathematically intuitive and practically useful expressions. Finally, we also study generalized independence between subsets of datapoints (random variables in the entropic case), and connect the independence characterizations to independence in log-submodular distributions. Regarding applications, we connect the maximization of submodular (conditional) mutual information to problems such as mutual-information-based, query-based, and privacy preserving summarization—and we connect optimizing the multi-set submodular mutual information to clustering and robust partitioning. We perform real world as well as synthetic experiments on various data summarization tasks. [ABSTRACT FROM AUTHOR]

Indoor objects detection and recognition plays an important role in computer science and artificial intelligence fields. This task plays also a crucial role especially for blind and visually impaired persons (VIP) assistance navigation. Aiming to address this problem, we propose in this paper to develop a new indoor object detection system based on deep learning algorithms. Unfortunately, this type of algorithms requires heavy computational resources, and energy consumption. To address this problem, we propose a CUDA multi-GPU framework implementation of the proposed system. Generally deep learning based algorithms require huge amount of data to train and test networks. We propose to develop a new indoor dataset which consists of 11,000 indoor images containing 25 indoor landmark objects highly recommended for blind and VIP navigation. Based on the obtained results, the developed system shows big efficiency in terms of detection accuracy as well as processing time. [ABSTRACT FROM AUTHOR]

Relaibility is an essential characteristic of computer machine. Computer system have reliability that why it is used in many fields. Artificial Intelligent and Machine Learning is wide branch in which number of applications has been developed and used in real world scenario. This paper highlights the computer system reliability in various fields where different applications have employed with better accuracy and reliable results. This paper also impact of computer system in branches that is computer science, physics, chemistry, and engineering etc. [ABSTRACT FROM AUTHOR]

In recommender systems, cold-start issues are situations where no previous events, e.g., ratings, are known for certain users or items. In this paper, we focus on the item cold-start problem. Both content information (e.g., item attributes) and initial user ratings are valuable for seizing users’ preferences on a new item. However, previous methods for the item cold-start problem either (1) incorporate content information into collaborative filtering to perform hybrid recommendation, or (2) actively select users to rate the new item without considering content information and then do collaborative filtering. In this paper, we propose a novel recommendation scheme for the item cold-start problem by leveraging both active learning and items’ attribute information. Specifically, we design useful user selection criteria based on items’ attributes and users’ rating history, and combine the criteria in an optimization framework for selecting users. By exploiting the feedback ratings, users’ previous ratings and items’ attributes, we then generate accurate rating predictions for the other unselected users. Experimental results on two real-world datasets show the superiority of our proposed method over traditional methods. [ABSTRACT FROM AUTHOR]

The seven papers included in this special issue represent a selection of extended contributions presented at the 16th International Conference on Soft Computing Models in Industrial and Environmental Applications, SOCO 2021, held in Bilbao, Spain, September 22nd-24th, 2021, and organized by the BISITE group and the University of Deusto. The SOCO 2021 international conference represents a collection or set of computational techniques in machine learning, computer science and some engineering disciplines that investigate, simulate, and analyse very complex issues and phenomena. This special issue is aimed at practitioners, researchers, and postgraduate students who are engaged in developing and applying advanced intelligent systems principles to solve real-world problems in the mentioned fields. [ABSTRACT FROM AUTHOR]

Searching for new high temperature superconductors has long been a key research issue. Fe-based superconductors attract researchers' attention due to their high transition temperature, strong irreversibility field, and excellent crystallographic symmetry. By using doping methods and dopant levels, different types of new Fe-based superconductors are synthesized. The transition temperature is a key indicator to measure whether new superconductors are high temperature superconductors. However, the condition for measuring transition temperature are strict, and the measurement process is dangerous. There is a strong relationship between the lattice parameters and the transition temperature of Fe-based superconductors. To avoid the difficulties in measuring transition temperature, in this paper, we adopt a machine learning method to build a model based on the lattice parameters to predict the transition temperature of Fe-based superconductors. The model results are in accordance with available transition temperatures, showing 91.181% accuracy. Therefore, we can use the proposed model to predict unknown transition temperatures of Fe-based superconductors. [ABSTRACT FROM AUTHOR]

Different from previous imputation methods which impute missing values in the incomplete samples by using the information in the complete samples, this paper proposes a Date-drive Incremental imputation Model, DIM for short, which uses all available information in the data set to impute missing values economically, effectively, orderly, and iteratively. To this end, we propose a scoring rule to rank the missing features by taking into account both the economical criterion and the effective imputation information. The economical criterion takes both the imputation cost and the discriminative ability of the feature into account, while the effective imputation information enables to use all observed information in the data set including the imputed missing values to impute the left missing values. During the imputation process, our DIM first detects the neednot-impute samples for reducing the imputation cost and noise, and then selects the missing features with the top rank to impute first. The imputation process orderly imputes the missing features until all missing values are imputed or the imputation cost is exhausted. Experimental results on UCI data sets demonstrated the advantages of our proposed DIM, compared to the comparison methods, in terms of prediction accuracy and classification accuracy. [ABSTRACT FROM AUTHOR]

Sparse representation (SR) has been widely studied and successfully applied to many areas of computer science in recent years. However, whether sparsity is essential to improve the classification performance is still an open question. Some studies reveal that it is the collaborative representation (CR) rather than SR that truly improves the classification performance. In this paper, the advantage of CR is further investigated and exploited, and a CR-based coding method is proposed. This method improves the classification performance by applying CR to the traditional nearest subspace (NS) method. Compared to the other NS method which codes the test sample on each class separately, the proposed method employs all samples to code the test sample collaboratively and preserves the subspace structure at the same time. The test sample is then classified to the class with the smallest representation error. Besides, a corresponding dictionary learning algorithm is also proposed so that the coding can be conducted on a dictionary learned from the training dataset. Since analytical solutions for coding and dictionary learning have been derived, our algorithm can be implemented efficiently. Experiments are conducted on seven face databases and the USPS handwritten digit database, and the results show that the proposed algorithm outperforms many state-of-the-art coding methods and dictionary learning methods, which demonstrates the power brought by CR. [ABSTRACT FROM AUTHOR]

This paper presents two on-going efforts of the Pacific Earthquake Engineering Research (PEER) center in the area of structural health monitoring. The first is data-driven damage assessment, which focuses on using data from instrumented buildings to compute the values of damage features. Using machine learning algorithms, these damage features are used for rapid identification of the level and location of damage after earthquakes. One of the damage features identified to be highly efficient is the cumulative absolute velocity. The second is vision-based automated damage identification and assessment from images. Deep learning techniques are used to conduct several identification tasks from images, examples of which are the structural component type, and level and type of damage. The objective is to use crowdsourcing, allowing the general public to take photographs of damage and upload them to a server where damage is automatically identified using deep learning algorithms. The paper also introduces PEER's effort and preliminary results in engaging the engineering and computer science communities in such developments through the PEER Hub Image- Net (Φ-Net) challenge. [ABSTRACT FROM AUTHOR]

Label distribution learning (LDL) is proposed for solving the label ambiguity problem in recent years, which can be seen as an extension of multi-label learning. To improve the performance of label distribution learning, some existing algorithms exploit label correlations in a global manner that assumes the label correlations are shared by all instances. However, the instances in different groups may share different label correlations, and few label correlations are globally applicable in real-world tasks. In this paper, two novel label distribution learning algorithms are proposed by exploiting label correlations on local samples, which are called GD-LDL-SCL and Adam-LDL-SCL, respectively. To utilize the label correlations on local samples, the influence of local samples is encoded, and a local correlation vector is designed as the additional features for each instance, which is based on the different clustered local samples. Then, the label distribution for an unseen instance can be predicted by exploiting the original features and the additional features simultaneously. Extensive experiments on some real-world data sets validate that our proposed methods can address the label distribution problems effectively and outperform state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Ensemble clustering has been a popular research topic in data mining and machine learning. Despite its significant progress in recent years, there are still two challenging issues in the current ensemble clustering research. First, most of the existing algorithms tend to investigate the ensemble information at the object-level, yet often lack the ability to explore the rich information at higher levels of granularity. Second, they mostly focus on the direct connections (e.g., direct intersection or pair-wise co-occurrence) in the multiple base clusterings, but generally neglect the multiscale indirect relationship hidden in them. To address these two issues, this paper presents a novel ensemble clustering approach based on fast propagation of cluster-wise similarities via random walks. We first construct a cluster similarity graph with the base clusters treated as graph nodes and the cluster-wise Jaccard coefficient exploited to compute the initial edge weights. Upon the constructed graph, a transition probability matrix is defined, based on which the random walk process is conducted to propagate the graph structural information. Specifically, by investigating the propagating trajectories starting from different nodes, a new cluster-wise similarity matrix can be derived by considering the trajectory relationship. Then, the newly obtained cluster-wise similarity matrix is mapped from the cluster-level to the object-level to achieve an enhanced co-association matrix, which is able to simultaneously capture the object-wise co-occurrence relationship as well as the multiscale cluster-wise relationship in ensembles. Finally, two novel consensus functions are proposed to obtain the consensus clustering result. Extensive experiments on a variety of real-world datasets have demonstrated the effectiveness and efficiency of our approach. [ABSTRACT FROM AUTHOR]

Data-driven and machine learning based approaches for detecting, categorising and measuring abusive content such as hate speech and harassment have gained traction due to their scalability, robustness and increasingly high performance. Making effective detection systems for abusive content relies on having the right training datasets, reflecting a widely accepted mantra in computer science: Garbage In, Garbage Out. However, creating training datasets which are large, varied, theoretically-informed and that minimize biases is difficult, laborious and requires deep expertise. This paper systematically reviews 63 publicly available training datasets which have been created to train abusive language classifiers. It also reports on creation of a dedicated website for cataloguing abusive language data hatespeechdata.com. We discuss the challenges and opportunities of open science in this field, and argue that although more dataset sharing would bring many benefits it also poses social and ethical risks which need careful consideration. Finally, we provide evidence-based recommendations for practitioners creating new abusive content training datasets. [ABSTRACT FROM AUTHOR]

Artificial intelligence technologies and data structures required for training have become more accessible in recent years and this has enabled artists to incorporate these technologies into their works to various ends. This paper is concerned with the ways in which present day artists are engaging with artificial intelligence, specifically material practices that endeavour to use these technologies and their potential non-human agencies as collaborators with differential objectives to commercial fields. The intentions behind artists' use of artificial intelligence is varied. Many works, with the accelerating assimilation of artificial intelligence technologies into everyday life, follow a critical path. Such as attempting to unveil how artificial intelligence materially works and is embodied, or to critically work through the potential future adoptions of artificial intelligence technologies into everyday life. However, I diverge from unpacking the criticality of these works and instead follow the suggestion of Bruno Latour to consider their composition. As for Latour, critique implies the capacity to discover a 'truer' understanding of reality, whereas composition addresses immanence, how things come together and the emergence of experience. Central to this paper are works that seek to collaborate with artificial intelligence, and to use it to drift out of rather than to affirm or mimic human agency. This goes beyond techniques such as 'style transfer' which is seen to support and encode existing human biases or patterns in data. Collaboration with signifies a recognition of a wider field of what constitutes the activity of artistic composition beyond being a singularly human, or AI, act, where composition can be situated in a system. This paper will look at how this approach allows an artist to consider the emerging materiality of a system which they are composing, its resistances and potentials, and the possibilities afforded by the exchange between human and machine intentions in co-composition. [ABSTRACT FROM AUTHOR]