![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Flexible Query Answering in Data Cubes
This paper presents a new approach toward approximate query answering in data warehouses. The approach is based on an adaptation of rough set theory to multidimensional data, and offers cube exploration and mi...
-
Chapter and Conference Paper
Rough Mode: A Generalized Centroid Proposal for Clustering Categorical Data Using the Rough Set Theory
Clustering is a widely used Data Mining method that aims to partition a given dataset into homogenous groups according to some predefined similarity criterion. The k-modes is a well known categorical clustering m...
-
Article
A rough set based algorithm for updating the modes in categorical clustering
The categorical clustering problem has attracted much attention especially in the last decades since many real world applications produce categorical data. The k-mode algorithm, proposed since 1998, and its multi...
-
Chapter and Conference Paper
Multi-task Learning Dataset for the Development of Remote Patient Monitoring System
The COVID-19 pandemic caused havoc on the world, infecting more than 3.5 billion people and resulting in over 15 million deaths, and overwhelmed existing healthcare infrastructures around the world, as announc...
-
Article
A review on kinship verification from facial information
Kinship verification is a challenging computer vision task that aims to mainly answer the question: “Are these two persons blood relatives?”. It is an important area of research with many applications, includi...