The following pages link to Data Mining and Knowledge Discovery (Q69103):
Displaying 50 items.
- Ensemble-based community detection in multilayer networks (Q1741350) (← links)
- Differentially private nearest neighbor classification (Q1741355) (← links)
- Discovering recurring activity in temporal networks (Q1741356) (← links)
- Noise-tolerance matrix completion for location recommendation (Q1741358) (← links)
- Imbalanced classification in sparse and large behaviour datasets (Q1741360) (← links)
- Time series joins, motifs, discords and shapelets: a unifying view that exploits the matrix profile (Q1741368) (← links)
- Bsig: evaluating the statistical significance of biclustering solutions (Q1741369) (← links)
- Fast and accurate mining of correlated heavy hitters (Q1741373) (← links)
- Selective harvesting over networks (Q1741374) (← links)
- Model-based and actual independence for fairness-aware classification (Q1741377) (← links)
- Online estimation of discrete, continuous, and conditional joint densities using classifier chains (Q1741380) (← links)
- Anytime discovery of a diverse set of patterns with Monte Carlo tree search (Q1741383) (← links)
- An optimization model for collaborative recommendation using a covariance-based regularizer (Q1741385) (← links)
- Kernel mixture model for probability density estimation in Bayesian classifiers (Q1741388) (← links)
- Interpretation of text patterns (Q1741391) (← links)
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model (Q1741393) (← links)
- SICA: subjectively interesting component analysis (Q1741396) (← links)
- Speeding up similarity search under dynamic time warping by pruning unpromising alignments (Q1741398) (← links)
- Cluster-based trajectory segmentation with local noise (Q1741405) (← links)
- Anomaly detection in spatiotemporal data via regularized non-negative tensor analysis (Q1741411) (← links)
- Anytime parallel density-based clustering (Q1741415) (← links)
- Introduction to the special issue for the ECML PKDD 2018 journal track (Q1741416) (← links)
- Fast schemes for online record linkage (Q1741418) (← links)
- Efficiently summarizing attributed diffusion networks (Q1741422) (← links)
- Linear regression for uplift modeling (Q1741425) (← links)
- Social centrality using network hierarchy and community structure (Q1741429) (← links)
- Explaining anomalies in groups with characterizing subspace rules (Q1741431) (← links)
- Informix under CONTROL: Online query processing (Q1856250) (← links)
- Discovering interesting patterns for investment decision making with GLOWER -- a genetic learner overlaid with entropy reduction (Q1856253) (← links)
- PUBLIC: A decision tree classifier that integrates building and pruning (Q1856254) (← links)
- Applications of data mining to electronic commerce (Q1859858) (← links)
- Personalization of supermarket product recommendations (Q1859859) (← links)
- Expert-driven validation of rule-based user models in personalization applications (Q1859861) (← links)
- Visualization and analysis of clickstream data of online stores for understanding web merchandising (Q1859865) (← links)
- Data mining for measuring and improving the success of web sites (Q1859867) (← links)
- E-commerce recommendation applications (Q1859871) (← links)
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining (Q1944967) (← links)
- Regularized nonnegative shared subspace learning (Q1944970) (← links)
- Exploiting unlabeled data to enhance ensemble diversity (Q1944971) (← links)
- Summarizing categorical data by clustering attributes (Q1944973) (← links)
- Score-based methods for learning Markov boundaries by searching in constrained spaces (Q1944976) (← links)
- Mining closed strict episodes (Q1944978) (← links)
- Discovering injective episodes with general partial orders (Q1944981) (← links)
- A practical approximation algorithm for optimal \(k\)-anonymity (Q1944983) (← links)
- Comparing apples and oranges: measuring differences between exploratory data mining results (Q1944984) (← links)
- Finding density-based subspace clusters in graphs with feature vectors (Q1944987) (← links)
- Actively learning to infer social ties (Q1944988) (← links)
- Tensor factorization using auxiliary information (Q1944991) (← links)
- Fast support vector machines for convolution tree kernels (Q1944994) (← links)
- Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
