The following pages link to Data Mining and Knowledge Discovery (Q69103):
Displaying 50 items.
- Chebyshev approaches for imbalanced data streams regression models (Q2066647) (← links)
- Continuous treatment effect estimation via generative adversarial de-confounding (Q2066652) (← links)
- Characterizing attitudinal network graphs through frustration cloud (Q2066654) (← links)
- BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent (Q2066656) (← links)
- Early abandoning and pruning for elastic distances including dynamic time warping (Q2066658) (← links)
- MultiETSC: automated machine learning for early time series classification (Q2066661) (← links)
- CURIE: a cellular automaton for concept drift detection (Q2066663) (← links)
- VFC-SMOTE: very fast continuous synthetic minority oversampling for evolving data streams (Q2066665) (← links)
- Unsupervised domain adaptation with non-stochastic missing data (Q2066667) (← links)
- VPint: value propagation-based spatial interpolation (Q2097440) (← links)
- The minimum description length principle for pattern mining: a survey (Q2097441) (← links)
- EmbAssi: embedding assignment costs for similarity search in large graph databases (Q2097444) (← links)
- Coupled block diagonal regularization for multi-view subspace clustering (Q2097445) (← links)
- TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions (Q2097447) (← links)
- Robust subgroup discovery. Discovering subgroup lists using MDL (Q2097449) (← links)
- Dynamic cyber risk estimation with competitive quantile autoregression (Q2134032) (← links)
- Efficient binary embedding of categorical data using BinSketch (Q2134033) (← links)
- An eager splitting strategy for online decision trees in ensembles (Q2134037) (← links)
- INK: knowledge graph embeddings for node classification (Q2134043) (← links)
- Sequence graph transform (SGT): a feature embedding function for sequence data mining (Q2134047) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Synwalk: community detection via random walk modelling (Q2134053) (← links)
- Robust regression via error tolerance (Q2134056) (← links)
- Counterfactual inference with latent variable and its application in mental health care (Q2134063) (← links)
- PAC-Bayesian lifelong learning for multi-armed bandits (Q2134066) (← links)
- Introducing the contrast profile: a novel time series primitive that allows real world classification (Q2134067) (← links)
- Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning (Q2147403) (← links)
- Sufficient dimension reduction for average causal effect estimation (Q2147407) (← links)
- Ranking with submodular functions on a budget (Q2147409) (← links)
- The area under the ROC curve as a measure of clustering quality (Q2147411) (← links)
- Simplification of genetic programs: a literature survey (Q2172617) (← links)
- Interpreting deep learning models with marginal attribution by conditioning on quantiles (Q2172619) (← links)
- Grouped feature importance and combined features effect plot (Q2172623) (← links)
- Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices (Q2172627) (← links)
- Extended missing data imputation via GANs for ranking applications (Q2172630) (← links)
- Conclusive local interpretation rules for random forests (Q2172632) (← links)
- SPEck: mining statistically-significant sequential patterns efficiently with exact sampling (Q2172635) (← links)
- Guided sampling for large graphs (Q2194031) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- An ultra-fast time series distance measure to allow data mining in more complex real-world deployments (Q2194038) (← links)
- ABBA: adaptive Brownian bridge-based symbolic aggregation of time series (Q2194039) (← links)
- Delayed labelling evaluation for data streams (Q2212504) (← links)
- Exceptional spatio-temporal behavior mining through Bayesian non-parametric modeling (Q2212505) (← links)
- Fair-by-design matching (Q2212506) (← links)
- Scalable attack on graph data by injecting vicious nodes (Q2212510) (← links)
- \textsc{Treant}: training evasion-aware decision trees (Q2212514) (← links)
- Large-scale network motif analysis using compression (Q2212516) (← links)
- ROCKET: exceptionally fast and accurate time series classification using random convolutional kernels (Q2212518) (← links)
- Active learning for hierarchical multi-label classification (Q2212520) (← links)
- CrawISN: community-aware data acquisition with maximum willingness in online social networks (Q2212525) (← links)
