• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-09-21
Marvin Meeng, Arno Knobbe

Subgroup discovery (SD) is an exploratory pattern mining paradigm that comes into its own when dealing with large real-world data, which typically involves many attributes, of a mixture of data types. Essential is the ability to deal with numeric attributes, whether they concern the target (a regression setting) or the description attributes (by which subgroups are identified). Various specific algorithms

更新日期：2020-09-22
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-09-20
Hakkyu Kim, Dong-Wan Choi

The standard sequential pattern mining scheme hardly considers the positions of events in a sequence, and therefore it is difficult to focus on more interesting patterns that represent better the causal relationships between events. Without quantifying how close two events are in a sequence, we may fail to evaluate how likely an event is caused by the others from the pattern, which is a severe drawback

更新日期：2020-09-20
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-09-09
Sarang Kapoor, Dhish Kumar Saxena, Matthijs van Leeuwen

Many real-world phenomena can be represented as dynamic graphs, i.e., networks that change over time. The problem of dynamic graph summarization, i.e., to succinctly describe the evolution of a dynamic graph, has been widely studied. Existing methods typically use objective measures to find fixed structures such as cliques, stars, and cores. Most of the methods, however, do not consider the problem

更新日期：2020-09-10
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-09-08
Maryam Habibi, Johannes Starlinger, Ulf Leser

Tables are a common way to present information in an intuitive and concise manner. They are used extensively in media such as scientific articles or web pages. Automatically analyzing the content of tables bears special challenges. One of the most basic tasks is determination of the orientation of a table: In column tables, columns represent one entity with the different attribute values present in

更新日期：2020-09-08
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-09-07
Hassan Ismail Fawaz, Benjamin Lucas, Germain Forestier, Charlotte Pelletier, Daniel F. Schmidt, Jonathan Weber, Geoffrey I. Webb, Lhassane Idoumghar, Pierre-Alain Muller, François Petitjean

This paper brings deep learning at the forefront of research into time series classification (TSC). TSC is the area of machine learning tasked with the categorization (or labelling) of time series. The last few decades of work in this area have led to significant progress in the accuracy of classifiers, with the state of the art now represented by the HIVE-COTE algorithm. While extremely accurate,

更新日期：2020-09-08
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-09-08
Bay-Yuan Hsu; Chia-Lin Tu; Ming-Yi Chang; Chih-Ya Shen

Real social network datasets with community structures are critical for evaluating various algorithms in Online Social Networks (OSNs). However, obtaining such community data from OSNs has recently become increasingly challenging due to privacy issues and government regulations. In this paper, we thus make our first attempt to address two important factors, i.e., user willingness and existence of community

更新日期：2020-09-08
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-08-30
Alberto Lumbreras, Louis Filstroff, Cédric Févotte

Binary data matrices can represent many types of data such as social networks, votes, or gene expression. In some cases, the analysis of binary matrices can be tackled with nonnegative matrix factorization (NMF), where the observed data matrix is approximated by the product of two smaller nonnegative matrices. In this context, probabilistic NMF assumes a generative model where the data is usually

更新日期：2020-08-30
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-08-03
Jadson Castro Gertrudes, Arthur Zimek, Jörg Sander, Ricardo J. G. B. Campello

The article, A unified view of density-based methods for semi-supervised.

更新日期：2020-08-03
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-08-03
Shameem A. Puthiya Parambath; Sanjay Chawla

Recommender systems are widely used in online platforms for easy exploration of personalized content. The best available recommendation algorithms are based on using the observed preference information among collaborating entities. A significant challenge in recommender system continues to be item cold-start recommendation: how to effectively recommend items with no observed or past preference information

更新日期：2020-08-03
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-27
Jadson Castro Gertrudes; Arthur Zimek; Jörg Sander; Ricardo J. G. B. Campello

Semi-supervised learning is drawing increasing attention in the era of big data, as the gap between the abundance of cheap, automatically collected unlabeled data and the scarcity of labeled data that are laborious and expensive to obtain is dramatically increasing. In this paper, we first introduce a unified view of density-based clustering algorithms. We then build upon this view and bridge the areas

更新日期：2020-07-27
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-25
Qian Ma, Wang-Chien Lee, Tao-Yang Fu, Yu Gu, Ge Yu

Due to the ubiquitous presence of missing values (MVs) in real-world datasets, the MV imputation problem, aiming to recover MVs, is an important and fundamental data preprocessing step for various data analytics and mining tasks to effectively achieve good performance. To impute MVs, a typical idea is to explore the correlations amongst the attributes of the data. However, those correlations are usually

更新日期：2020-07-25
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-21
Guiliang Liu; Yudong Luo; Oliver Schulte; Tarak Kharrat

Given the large pitch, numerous players, limited player turnovers, and sparse scoring, soccer is arguably the most challenging to analyze of all the major team sports. In this work, we develop a new approach to evaluating all types of soccer actions from play-by-play event data. Our approach utilizes a Deep Reinforcement Learning (DRL) model to learn an action-value Q-function. To our knowledge, this

更新日期：2020-07-21
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-17
Felipe Kenji Nakano; Ricardo Cerri; Celine Vens

Due to technological advances, a massive amount of data is produced daily, presenting challenges for application areas where data needs to be labelled by a domain specialist or by expensive procedures, in order to be useful for supervised machine learning purposes. In order to select which data points will provide more information when labelled, one can make use of active learning methods. Active learning

更新日期：2020-07-17
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-15
Marco Capó; Aritz Pérez; Jose A. Lozano

The analysis of continously larger datasets is a task of major importance in a wide variety of scientific fields. Therefore, the development of efficient and parallel algorithms to perform such an analysis is a a crucial topic in unsupervised learning. Cluster analysis algorithms are a key element of exploratory data analysis and, among them, the K-means algorithm stands out as the most popular approach

更新日期：2020-07-15
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-13
Angus Dempster; François Petitjean; Geoffrey I. Webb

Most methods for time series classification that attain state-of-the-art accuracy have high computational complexity, requiring significant training time even for smaller datasets, and are intractable for larger datasets. Additionally, many existing methods focus on a single type of feature such as shape or frequency. Building on the recent success of convolutional neural networks for time series classification

更新日期：2020-07-13
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-07
Vinicius M. A. Souza, Denis M. dos Reis, André G. Maletzke, Gustavo E. A. P. A. Batista

Streaming data are increasingly present in real-world applications such as sensor measurements, satellite data feed, stock market, and financial data. The main characteristics of these applications are the online arrival of data observations at high speed and the susceptibility to changes in the data distributions due to the dynamic nature of real environments. The data stream mining community still

更新日期：2020-07-07
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-06
Jake H. Lee, Kiri L. Wagstaff

The initial analysis of any large data set can be divided into two phases: (1) the identification of common trends or patterns and (2) the identification of anomalies or outliers that deviate from those trends. We focus on the goal of detecting observations with novel content, which can alert us to artifacts in the data set or, potentially, the discovery of previously unknown phenomena. To aid in interpreting

更新日期：2020-07-07
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-03
Chenxu Wang, Yang Wang, Zhiyuan Zhao, Dong Qin, Xiapu Luo, Tao Qin

Structural network alignment utilizes the topological structure information to find correspondences between nodes of two networks. Researchers have proposed a line of useful algorithms which usually require a prior mapping of seeds acting as landmark points to align the rest nodes. Several seed-free algorithms are developed to solve the cold-start problem. However, existing approaches suffer high computational

更新日期：2020-07-03
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-02
Shima Imani, Frank Madrid, Wei Ding, Scott E. Crouter, Eamonn Keogh

The first question a data analyst asks when confronting a new dataset is often, “Show me some representative/typical data.” Answering this question is simple in many domains, with random samples or aggregate statistics of some kind. Surprisingly, it is difficult for large time series datasets. The major difficulty is not time or space complexity, but defining what it means to be representative data

更新日期：2020-07-03
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-07-02
Ofir Lindenbaum,Moshe Salhov,Arie Yeredor,Amir Averbuch

Kernel methods play a critical role in many machine learning algorithms. They are useful in manifold learning, classification, clustering and other data analysis tasks. Setting the kernel’s scale parameter, also referred to as the kernel’s bandwidth, highly affects the performance of the task in hand. We propose to set a scale parameter that is tailored to one of two types of tasks: classification

更新日期：2020-07-02
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-23
Peter Bloem; Steven de Rooij

We introduce a new method for finding network motifs. Subgraphs are motifs when their frequency in the data is high compared to the expected frequency under a null model. To compute this expectation, a full or approximate count of the occurrences of a motif is normally repeated on as many as 1000 random graphs sampled from the null model; a prohibitively expensive step. We use ideas from the minimum

更新日期：2020-06-23
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-21
Stefano Calzavara; Claudio Lucchese; Gabriele Tolomei; Seyum Assefa Abebe; Salvatore Orlando

Despite its success and popularity, machine learning is now recognized as vulnerable to evasion attacks, i.e., carefully crafted perturbations of test inputs designed to force prediction errors. In this paper we focus on evasion attacks against decision tree ensembles, which are among the most successful predictive models for dealing with non-perceptual problems. Even though they are powerful and interpretable

更新日期：2020-06-21
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-17
Jihong Wang; Minnan Luo; Fnu Suya; Jundong Li; Zijiang Yang; Qinghua Zheng

Recent studies have shown that graph convolution networks (GCNs) are vulnerable to carefully designed attacks, which aim to cause misclassification of a specific node on the graph with unnoticeable perturbations. However, a vast majority of existing works cannot handle large-scale graphs because of their high time complexity. Additionally, existing works mainly focus on manipulating existing nodes

更新日期：2020-06-17
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-16
Hannah R. Kerner, Kiri L. Wagstaff, Brian D. Bue, Danika F. Wellington, Samantha Jacob, Paul Horton, James F. Bell, Chiman Kwan, Heni Ben Amor

Science teams for rover-based planetary exploration missions like the Mars Science Laboratory Curiosity rover have limited time for analyzing new data before making decisions about follow-up observations. There is a need for systems that can rapidly and intelligently extract information from planetary instrument datasets and focus attention on the most promising or novel observations. Several novelty

更新日期：2020-06-16
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-16
Patrick Schäfer; Ulf Leser

Early time series classification (eTSC) is the problem of classifying a time series after as few measurements as possible with the highest possible accuracy. The most critical issue of any eTSC method is to decide when enough data of a time series has been seen to take a decision: Waiting for more data points usually makes the classification problem easier but delays the time in which a classification

更新日期：2020-06-16
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-09
Leonardo Pellegrina; Fabio Vandin

The extraction of patterns displaying significant association with a class label is a key data mining task with wide application in many domains. We introduce and study a variant of the problem that requires to mine the top-k statistically significant patterns, thus providing tight control on the number of patterns reported in output. We develop TopKWY, the first algorithm to mine the top-k significant

更新日期：2020-06-09
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-06
Zhuo Wang, Runlong Hu, Qian Chen, Pei Gao, Xiaowei Xu

Product reviews are extremely valuable for online shoppers in providing purchase decisions. Driven by immense profit incentives, fraudsters deliberately fabricate untruthful reviews to distort the reputation of online products. As online reviews become more and more important, group spamming, i.e., a team of fraudsters working collaboratively to attack a set of target products, becomes a new fashion

更新日期：2020-06-06
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-03
Saeid Hosseini; Saeed Najafipour; Ngai-Man Cheung; Hongzhi Yin; Mohammad Reza Kangavari; Xiaofang Zhou

Contagions (e.g. virus and gossip) spread over the nodes in propagation graphs. We can use temporal-textual contents of nodes to compute the edge weights and generate subgraphs with highly relevant nodes. This is beneficial to many applications. Yet, challenges abound. First, the propagation pattern between each pair of nodes may change by time. Second, not always the same contagion propagates. Hence

更新日期：2020-06-03
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-06-03
Steven Elsworth; Stefan Güttel

A new symbolic representation of time series, called ABBA, is introduced. It is based on an adaptive polygonal chain approximation of the time series into a sequence of tuples, followed by a mean-based clustering to obtain the symbolic representation. We show that the reconstruction error of this representation can be modelled as a random walk with pinned start and end points, a so-called Brownian

更新日期：2020-06-03
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-05-30
Shaghayegh Gharghabi; Shima Imani; Anthony Bagnall; Amirali Darvishzadeh; Eamonn Keogh

At their core, many time series data mining algorithms reduce to reasoning about the shapes of time series subsequences. This requires an effective distance measure, and for last two decades most algorithms use Euclidean distance or DTW as their core subroutine. We argue that these distance measures are not as robust as the community seems to believe. The undue faith in these measures perhaps derives

更新日期：2020-05-30
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-05-12
Yulong Pei; Xin Du; Jianpeng Zhang; George Fletcher; Mykola Pechenizkiy

Network embedding (NE) is playing a principal role in network mining, due to its ability to map nodes into efficient low-dimensional embedding vectors. However, two major limitations exist in state-of-the-art NE methods: role preservation and uncertainty modeling. Almost all previous methods represent a node into a point in space and focus on local structural information, i.e., neighborhood information

更新日期：2020-05-12
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-05-07
Michele Linardi; Yan Zhu; Themis Palpanas; Eamonn Keogh

In the last 15 years, data series motif and discord discovery have emerged as two useful and well-used primitives for data series mining, with applications to many domains, including robotics, entomology, seismology, medicine, and climatology. Nevertheless, the state-of-the-art motif and discord discovery tools still require the user to provide the relative length. Yet, in several cases, the choice

更新日期：2020-05-07
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-05-05
Jinghan Meng; Napath Pitaksirianan; Yi-Cheng Tu

In recent years, the popularity of graph databases has grown rapidly. This paper focuses on single-graph as an effective model to represent information and its related graph mining techniques. In frequent pattern mining in a single-graph setting, there are two main problems: support measure and search scheme. In this paper, we propose a novel framework for designing support measures that brings together

更新日期：2020-05-05
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-03-31
Yan Zhu; Shaghayegh Gharghabi; Diego Furtado Silva; Hoang Anh Dau; Chin-Chia Michael Yeh; Nader Shakibay Senobari; Abdulaziz Almaslukh; Kaveh Kamgar; Zachary Zimmerman; Gareth Funning; Abdullah Mueen; Eamonn Keogh

The recently introduced data structure, the Matrix Profile, annotates a time series by recording the location of and distance to the nearest neighbor of every subsequence. This information trivially provides answers to queries for both time series motifs and time series discords, perhaps two of the most frequently used primitives in time series data mining. One attractive feature of the Matrix Profile

更新日期：2020-03-31
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-03-18

Large real-world graphs claim lots of resources in terms of memory and computational power to study them and this makes their full analysis extremely challenging. In order to understand the structure and properties of these graphs, we intend to extract a small representative subgraph from a big graph while preserving its topology and characteristics. In this work, we aim at producing good samples with

更新日期：2020-03-18
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-03-16
Taha Ceritli; Christopher K. I. Williams; James Geddes

Type inference refers to the task of inferring the data type of a given column of data. Current approaches often fail when data contains missing data and anomalies, which are found commonly in real-world data sets. In this paper, we propose ptype, a probabilistic robust type inference method that allows us to detect such entries, and infer data types. We further show that the proposed method outperforms

更新日期：2020-03-16
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-03-16
Zengyou He; Hao Liang; Zheng Chen; Can Zhao; Yan Liu

Community detection is one of the most important issues in modern network science. Although numerous community detection algorithms have been proposed during the past decades, how to assess the statistical significance of one single community analytically and exactly still remains an open problem. In this paper, we present an analytical solution to calculate the exact p-value of a single community

更新日期：2020-03-16
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-03-14
Matthias Schmid; Thomas Welchowski; Marvin N. Wright; Moritz Berger

Random survival forests (RSF) are a powerful nonparametric method for building prediction models with a time-to-event outcome. RSF do not rely on the proportional hazards assumption and can be readily applied to both low- and higher-dimensional data. A remaining limitation of RSF, however, arises from the fact that the method is almost entirely focussed on continuously measured event times. This issue

更新日期：2020-03-14
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-03-05
Ahmed Shifaz; Charlotte Pelletier; François Petitjean; Geoffrey I. Webb

Time Series Classification (TSC) has seen enormous progress over the last two decades. HIVE-COTE (Hierarchical Vote Collective of Transformation-based Ensembles) is the current state of the art in terms of classification accuracy. HIVE-COTE recognizes that time series data are a specific data type for which the traditional attribute-value representation, used predominantly in machine learning, fails

更新日期：2020-03-05
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-02-20
Irene Ortner; Peter Filzmoser; Christophe Croux

We propose a robust and sparse classification method based on the optimal scoring approach. It is also applicable if the number of variables exceeds the number of observations. The data are first projected into a low dimensional subspace according to an optimal scoring criterion. The projection only includes a subset of the original variables (sparse modeling) and is not distorted by outliers (robust

更新日期：2020-02-20
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-02-19
Fatemeh Riahi; Oliver Schulte

This paper develops model-based exception mining and outlier detection for the case of object-relational data. Object-relational data represent a complex heterogeneous network, which comprises objects of different types, links among these objects, also of different types, and attributes of these links. We follow the well-established exceptional model mining (EMM) framework, which has been previously

更新日期：2020-02-19
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-02-04
David García-Soriano; Francesco Bonchi

Matching algorithms are used routinely to match donors to recipients for solid organs transplantation, for the assignment of medical residents to hospitals, record linkage in databases, scheduling jobs on machines, network switching, online advertising, and image recognition, among others. Although many optimal solutions may exist to a given matching problem, when the elements that shall or not be

更新日期：2020-02-04
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-01-30
Carlos Andres Ferrero; Lucas May Petry; Luis Otavio Alvares; Camila Leite da Silva; Willian Zalewski; Vania Bogorny

In the last few years trajectory classification has been applied to many real problems, basically considering the dimensions of space and time or attributes inferred from these dimensions. However, with the explosion of social media data and the advances in the semantic enrichment of mobility data, a new type of trajectory data has emerged, and the trajectory spatio-temporal points have now multiple

更新日期：2020-01-30
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-01-29
Xin Du; Yulong Pei; Wouter Duivesteijn; Mykola Pechenizkiy

Collective social media provides a vast amount of geo-tagged social posts, which contain various records on spatio-temporal behavior. Modeling spatio-temporal behavior on collective social media is an important task for applications like tourism recommendation, location prediction and urban planning. Properly accomplishing this task requires a model that allows for diverse behavioral patterns on each

更新日期：2020-01-29
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-01-21
Thomas Guyet; René Quiniou

Sequential pattern mining is concerned with the extraction of frequent or recurrent behaviors, modeled as subsequences, from a sequence dataset. Such patterns inform about which events are frequently observed in sequences, i.e. events that really happen. Sometimes, knowing that some specific event does not happen is more informative than extracting observed events. Negative sequential patterns (NSPs)

更新日期：2020-01-21
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-01-17
Florian Adriaens; Tijl De Bie; Aristides Gionis; Jefrey Lijffijt; Antonis Matakos; Polina Rozenshtein

Social networks often provide only a binary perspective on social ties: two individuals are either connected or not. While sometimes external information can be used to infer the strength of social ties, access to such information may be restricted or impractical to obtain. Sintos and Tsaparas (KDD 2014) first suggested to infer the strength of social ties from the topology of the network alone, by

更新日期：2020-01-17
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-01-13
Diego Olaya; Kristof Coussement; Wouter Verbeke

Uplift modeling is an instrument used to estimate the change in outcome due to a treatment at the individual entity level. Uplift models assist decision-makers in optimally allocating scarce resources. This allows the selection of the subset of entities for which the effect of a treatment will be largest and, as such, the maximization of the overall returns. The literature on uplift modeling mostly

更新日期：2020-01-13
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-02-14
Shaghayegh Gharghabi, Chin-Chia Michael Yeh, Yifei Ding, Wei Ding, Paul Hibbing, Samuel LaMunion, Andrew Kaplan, Scott E. Crouter, Eamonn Keogh

The article Domain agnostic online semantic segmentation for multi-dimensional time series, written by Shaghayegh Gharghabi, Chin-Chia Michael Yeh, Yifei Ding, Wei Ding, Paul Hibbing, Samuel LaMunion, Andrew Kaplan, Scott E. Crouter, Eamonn Keogh was originally published electronically on the publisher’s internet portal (currently SpringerLink) on 25 September 2018 without open access.

更新日期：2020-01-04
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-01-02
Fedor V. Fomin; Petr A. Golovach; Fahad Panolan

Low-rank binary matrix approximation is a generic problem where one seeks a good approximation of a binary matrix by another binary matrix with some specific properties. A good approximation means that the difference between the two matrices in some matrix norm is small. The properties of the approximation binary matrix could be: a small number of different columns, a small binary rank or a small Boolean

更新日期：2020-01-02
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2020-01-02
Catherine Kerr; Terri Hoare; Paula Carroll; Jakub Mareček

The extraction of temporal events from text and the classification of temporal relations among both temporal events and time expressions are major challenges for the interface of data mining and natural language processing. We present an ensemble method, which reconciles the outputs of multiple heterogenous classifiers of temporal expressions. We use integer programming, a constrained optimisation

更新日期：2020-01-02
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-12-23
Loredana Caruccio; Vincenzo Deufemia; Giuseppe Polese

Relaxed functional dependencies (rfds) are properties expressing important relationships among data. Thanks to the introduction of approximations in data comparison and/or validity, they can capture constraints useful for several purposes, such as the identification of data inconsistencies or patterns of semantically related data. Nevertheless, rfds can provide benefits only if they can be automatically

更新日期：2019-12-23
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-11-26
Adnene Belfodil; Sylvie Cazalens; Philippe Lamarre; Marc Plantevit

Under the term behavioral data, we consider any type of data featuring individuals performing observable actions on entities. For instance, voting data depict parliamentarians who express their votes w.r.t. legislative procedures. In this work, we address the problem of discovering exceptional (dis)agreement patterns in such data, i.e., groups of individuals that exhibit an unexpected (dis)agreement

更新日期：2019-11-26
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-11-22
Anes Bendimerad; Ahmad Mel; Jefrey Lijffijt; Marc Plantevit; Céline Robardet; Tijl De Bie

Data clustering, local pattern mining, and community detection in graphs are three mature areas of data mining and machine learning. In recent years, attributed subgraph mining has emerged as a new powerful data mining task in the intersection of these areas. Given a graph and a set of attributes for each vertex, attributed subgraph mining aims to find cohesive subgraphs for which (some of) the attribute

更新日期：2019-11-22
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-11-21
Sevvandi Kandanaarachchi; Mario A. Muñoz; Rob J. Hyndman; Kate Smith-Miles

This paper demonstrates that the performance of various outlier detection methods is sensitive to both the characteristics of the dataset, and the data normalization scheme employed. To understand these dependencies, we formally prove that normalization affects the nearest neighbor structure, and density of the dataset; hence, affecting which observations could be considered outliers. Then, we perform

更新日期：2019-11-21
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-11-18
Chang Wei Tan; François Petitjean; Geoffrey I. Webb

In recent years, many new ensemble-based time series classification (TSC) algorithms have been proposed. Each of them is significantly more accurate than their predecessors. The Hierarchical Vote Collective of Transformation-based Ensembles (HIVE-COTE) is currently the most accurate TSC algorithm when assessed on the UCR repository. It is a meta-ensemble of 5 state-of-the-art ensemble-based classifiers

更新日期：2019-11-18
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-11-16
Maciej Grzenda; Heitor Murilo Gomes; Albert Bifet

A large portion of the stream mining studies on classification rely on the availability of true labels immediately after making predictions. This approach is well exemplified by the test-then-train evaluation, where predictions immediately precede true label arrival. However, in many real scenarios, labels arrive with non-negligible latency. This raises the question of how to evaluate classifiers trained

更新日期：2019-11-16
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-11-12

Rapid urbanization has made the estimation of the human mobility flows a substantial task for transportation and urban planners. Worker and student mobility flows are among the most weekly regular displacements and consequently generate road congestion issues. With urge of demands on efficient transport planning policies, estimating their commuting facilitates the decision-making processes for local

更新日期：2019-11-12
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-11-01
Meike Zehlike; Philipp Hacker; Emil Wiedemann

Increasingly, discrimination by algorithms is perceived as a societal and legal problem. As a response, a number of criteria for implementing algorithmic fairness in machine learning have been developed in the literature. This paper proposes the continuous fairness algorithm $$(\hbox {CFA}\theta )$$ which enables a continuous interpolation between different fairness definitions. More specifically,

更新日期：2019-11-01
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2019-10-22
James Large,Jason Lines,Anthony Bagnall

Our hypothesis is that building ensembles of small sets of strong classifiers constructed with different learning algorithms is, on average, the best approach to classification for real-world problems. We propose a simple mechanism for building small heterogeneous ensembles based on exponentially weighting the probability estimates of the base classifiers with an estimate of the accuracy formed through

更新日期：2019-11-01
• Data Min. Knowl. Discov. (IF 2.629) Pub Date : 2016-12-23
C Ranjith Kumar,S Suguna

This paper brings out a neoteric frame of reference for visual semantic based 3d video search and retrieval applications. Newfangled 3D retrieval application spotlight on shape analysis like object matching, classification and retrieval not only sticking up entirely with video retrieval. In this ambit, we delve into 3D-CBVR (Content Based Video Retrieval) concept for the first time. For this purpose

更新日期：2019-11-01
Contents have been reproduced by permission of the publishers.

down
wechat
bug