Data Mining
From MaRDI portal
Publication:5251246
DOI10.1007/978-3-319-14142-8zbMath1311.68001OpenAlexW4230765542MaRDI QIDQ5251246
Publication date: 19 May 2015
Full work available at URL: https://doi.org/10.1007/978-3-319-14142-8
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Data structures (68P05)
Related Items (41)
Detection of outlying proportions ⋮ Methodically unified procedures for a conditional approach to outlier detection, clustering, and classification ⋮ Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems ⋮ Sparsest factor analysis for clustering variables: a matrix decomposition approach ⋮ Physics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order bases ⋮ Efficient SVDD sampling with approximation guarantees for the decision boundary ⋮ Market basket analysis with association rules ⋮ NP-hardness of some Euclidean problems of partitioning a finite set of points ⋮ A stratified reservoir sampling algorithm in streams and large datasets ⋮ Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption ⋮ A survey of outlier detection in high dimensional data streams ⋮ Logical analysis of multiclass data with relaxed patterns ⋮ Approximation algorithm for the problem of partitioning a sequence into clusters ⋮ Selective bi-coordinate method for limit non-smooth resource allocation type problems ⋮ NP-hardness of some data cleaning problem ⋮ An adaptive partial linearization method for optimization problems on product sets ⋮ NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes ⋮ Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster ⋮ State of the art on quality control for data streams: a systematic literature review ⋮ Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters ⋮ Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation ⋮ Data Clustering with Actuarial Applications ⋮ Learning Temporal Causal Sequence Relationships from Real-Time Time-Series ⋮ Higher order mobile coverage control with applications to clustering of discrete sets ⋮ Inter classifier comparison to detect voice pathologies ⋮ Blessing of dimensionality: mathematical foundations of the statistical physics of data ⋮ An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities ⋮ Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center ⋮ On the complexity of some Euclidean problems of partitioning a finite set of points ⋮ Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases ⋮ Unnamed Item ⋮ Hybrid ASP-based Approach to Pattern Mining ⋮ Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability ⋮ Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence ⋮ Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem ⋮ A hybrid cascade neuro-fuzzy network with pools of extended neo-fuzzy neurons and its deep learning ⋮ EARC: evidential association rule-based classification ⋮ Construction of the similarity matrix for the spectral clustering method: numerical experiments ⋮ A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering ⋮ Novel criteria for elimination of the outliers in QSPR studies, when the `forward stepwise' procedure is used ⋮ Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
This page was built for publication: Data Mining
