The following pages link to Data Mining (Q5251246):
Displaying 33 items.
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases (Q526417) (← links)
- Sparsest factor analysis for clustering variables: a matrix decomposition approach (Q1630876) (← links)
- NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580) (← links)
- Approximation algorithm for the problem of partitioning a sequence into clusters (Q1683189) (← links)
- An adaptive partial linearization method for optimization problems on product sets (Q1686667) (← links)
- Higher order mobile coverage control with applications to clustering of discrete sets (Q1737771) (← links)
- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (Q1744981) (← links)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
- Inter classifier comparison to detect voice pathologies (Q1981201) (← links)
- Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627) (← links)
- EARC: evidential association rule-based classification (Q2056282) (← links)
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering (Q2066643) (← links)
- Methodically unified procedures for a conditional approach to outlier detection, clustering, and classification (Q2127130) (← links)
- Physics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order bases (Q2139039) (← links)
- Efficient SVDD sampling with approximation guarantees for the decision boundary (Q2163193) (← links)
- A survey of outlier detection in high dimensional data streams (Q2172855) (← links)
- Logical analysis of multiclass data with relaxed patterns (Q2178289) (← links)
- NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes (Q2191318) (← links)
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (Q2206419) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- A hybrid cascade neuro-fuzzy network with pools of extended neo-fuzzy neurons and its deep learning (Q2299157) (← links)
- Construction of the similarity matrix for the spectral clustering method: numerical experiments (Q2309260) (← links)
- Novel criteria for elimination of the outliers in QSPR studies, when the `forward stepwise' procedure is used (Q2322237) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← links)
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption (Q2403232) (← links)
- Selective bi-coordinate method for limit non-smooth resource allocation type problems (Q2416621) (← links)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- (Q5090449) (← links)
- NP-hardness of some data cleaning problem (Q5100127) (← links)
- Learning Temporal Causal Sequence Relationships from Real-Time Time-Series (Q5145839) (← links)
- Blessing of dimensionality: mathematical foundations of the statistical physics of data (Q5154201) (← links)
- State of the art on quality control for data streams: a systematic literature review (Q6158857) (← links)
