Work

Editorial

Year: 2020
Type: editorial
Abstract: This issue of the IDA journal is the third issue for our 24 th year of publication.It contains twelve articles representing a wide range of topics related to the theoretical and applied research in the field of Intelligent Data Analysis.The first two articles are about graph mining in IDA.The first article by Senthilselvan et al. is about distributed frequent subgraph mining which they emphasize plays a key role in retrieving required information or patterns from the huge amount of data in a short period of time.The authors argue that majority of the existing methods target static graphs, and the distributed solution for dynamic graphs has not been explored.The authors propose a novel approach called DFSME, which uses SPARK to discover frequent subgraphs from an evolving graph in a distributed environment.DFSME maintains a set of subgraphs between frequent and infrequent subgraphs, which is used to decrease the search space.Their experiments with synthetic and real-world datasets authorize the effectiveness of DFSME for mining recurrent subgraphs from huge evolving graph datasets.The second article by Gomez et al. is about on-line analytical processing which is based on the multidimensional model, where data can be seen as a cube such that each cell contains one or more measures that can be aggregated along dimensions.The authors propose a formal multidimensional model for graph analysis, that considers the basic graph data, and also background information in the form of dimension hierarchies.Their case study supports the claim that, for many kinds of OLAP-like analysis on graphs, the graphoid model works better than the typical relational OLAP alternative, and for the classic OLAP queries, it remains competitive.The second group of articles in this issue are about advanced learning in IDA.Faleiros et al. in the first article of this group discuss graph based algorithms where they propose an unsupervised learning algorithm based on the bipartite graph, referred to as Propagation in Bipartite Graph (PBG).The authors show that PBG is more flexible and easier to be adapted for different applications than the mathematical formalism of the generative models.Furthermore, the proposed algorithm can be parallelized and is competitive for tasks such as textual collection modelling.In the next article Zhang and Jatowt introduce a one-class Naïve Bayes text classifier.The authors address the problem of building a one-class classifier when only the positive examples are labelled.They show that a configurable one-class classier such as one-class Naive Bayes can be optimized by examining the clustering quality of the classification on target data.Their experimental analysis with real-world data shows that their approach generally achieves high classification accuracy, and in some cases improves the accuracy by more than 10% compared to state-of-art baselines.Luo and Yong in the third article of this group introduce a fusion bat algorithm to achieve higher accuracy and stability.Their experiments show that their proposed algorithm has remarkable advantages in accuracy and stability for high dimensional, unimodal and multimodal problems.Fazakis et al. in the next article of this group discuss active learning which is a typical approach for learning from both labelled and unlabeled examples aiming to build efficient and accurate predictive models at minimum expense under an expert's guidance.The authors introduce a pool-based active learning regression algorithm employing the query by committee strategy to evaluate the informative-
Language: Spanish
Open Access status: bronze
OpenAlex ID: W4232126304
Cites:
Cited by:
Related to: