The following pages link to Data Mining and Knowledge Discovery (Q69103):
Displaying 50 items.
- A regularized graph layout framework for dynamic network visualization (Q468664) (← links)
- Classification of time series by shapelet transformation (Q468669) (← links)
- Semi-supervised projected model-based clustering (Q468674) (← links)
- Feature selection for \(k\)-means clustering stability: theoretical analysis and an algorithm (Q468677) (← links)
- Behavior-based clustering and analysis of interestingness measures for association rule mining (Q468678) (← links)
- Discovering episodes with compact minimal windows (Q468680) (← links)
- Multiple instance learning via Gaussian processes (Q468681) (← links)
- Assessing the quality of multilevel graph clustering (Q468684) (← links)
- Special issue on data mining technologies for computational social science. Selected papers based on the presentations at the workshop on data mining technologies for computational collective intelligence (DMCCI), held in conjunction with IEEE internation (Q592216) (← links)
- Generalization-based privacy preservation and discrimination prevention in data publishing and mining (Q736497) (← links)
- Unsupervised interaction-preserving discretization of multivariate data (Q736501) (← links)
- Preserving worker privacy in crowdsourcing (Q736504) (← links)
- Approximating the crowd (Q736507) (← links)
- Discovering bands from graphs (Q736508) (← links)
- Self-organizing maps by difference of convex functions optimization (Q736509) (← links)
- Generating multiple alternative clusterings via globally optimal subspaces (Q740590) (← links)
- \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures (Q740594) (← links)
- CID: an efficient complexity-invariant distance for time series (Q740599) (← links)
- Subspace clustering of high-dimensional data: a predictive approach (Q740601) (← links)
- A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets (Q740603) (← links)
- Interesting pattern mining in multi-relational data (Q740605) (← links)
- Cost-sensitive ensemble learning: a unifying framework (Q832635) (← links)
- End-to-end deep representation learning for time series clustering: a comparative study (Q832639) (← links)
- Inferring range of information diffusion based on historical frequent items (Q832642) (← links)
- Mint: MDL-based approach for mining interesting numerical pattern sets (Q832644) (← links)
- Topic change point detection using a mixed Bayesian model (Q832647) (← links)
- Matrix sketching for supervised classification with imbalanced classes (Q832649) (← links)
- Generalized core maintenance of dynamic bipartite graphs (Q832654) (← links)
- Temporal state change Bayesian networks for modeling of evolving multivariate state sequences: model, structure discovery and parameter estimation (Q832658) (← links)
- An efficient procedure for mining egocentric temporal motifs (Q832661) (← links)
- Mining sequences with exceptional transition behaviour of varying order using quality measures based on information-theoretic scoring functions (Q832665) (← links)
- Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation (Q832666) (← links)
- Strengthening ties towards a highly-connected world (Q832669) (← links)
- Adaptive sampling methods for scaling up knowledge discovery algorithms (Q1597451) (← links)
- Advances in instance selection for instance-based learning algorithms (Q1597453) (← links)
- Likelihood-based data squashing: A modeling approach to instance construction (Q1597456) (← links)
- A unifying view on instance selection (Q1597458) (← links)
- Summarizing numeric spatial data streams by trend cluster discovery (Q1711218) (← links)
- Sequential network change detection with its applications to ad impact relation analysis (Q1711220) (← links)
- Erratum to: ``Unsupervised interaction-preserving discretization of multivariate data'' (Q1711221) (← links)
- Exemplar-based low-rank matrix decomposition for data clustering (Q1711222) (← links)
- Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series (Q1711225) (← links)
- Learning a symbolic representation for multivariate time series classification (Q1711227) (← links)
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)
- Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models (Q1711229) (← links)
- Survey on distance metric learning and dimensionality reduction in data mining (Q1711231) (← links)
- Time series classification with ensembles of elastic distance measures (Q1715861) (← links)
- Detecting anomaly collections using extreme feature ranks (Q1715864) (← links)
- On measuring similarity for sequences of itemsets (Q1715867) (← links)
- Evolutionary soft co-clustering: formulations, algorithms, and applications (Q1715873) (← links)
