The following pages link to Data Mining and Knowledge Discovery (Q69103):
Displaying 50 items.
- Multi-period classification: learning sequent classes from temporal domains (Q1715877) (← links)
- Evaluation measures for hierarchical classification: a unified view and novel approaches (Q1715882) (← links)
- Mining outlying aspects on numeric data (Q1715883) (← links)
- Finding the longest common sub-pattern in sequences of temporal intervals (Q1715886) (← links)
- \textsc{MassExodus}: modeling evolving networks in harsh environments (Q1715889) (← links)
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- DRESS: dimensionality reduction for efficient sequence search (Q1715895) (← links)
- Ranking episodes using a partition model (Q1715896) (← links)
- Clustering Boolean tensors (Q1715898) (← links)
- Efficient and effective community search (Q1715901) (← links)
- Generalization of clustering agreements and distances for overlapping clusters and network communities (Q1715904) (← links)
- Knowledge base completion by learning pairwise-interaction differentiated embeddings (Q1715905) (← links)
- The BOSS is concerned with time series classification in the presence of noise (Q1715907) (← links)
- Cluster validity functions for categorical data: a solution-space perspective (Q1715908) (← links)
- Weakly supervised nonnegative matrix factorization for user-driven clustering (Q1715911) (← links)
- A general framework for never-ending learning from time series streams (Q1715913) (← links)
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization (Q1715914) (← links)
- A general framework for predictive tensor modeling with domain knowledge (Q1715916) (← links)
- Discrimination- and privacy-aware patterns (Q1715918) (← links)
- Multi-relational pattern mining over data streams (Q1715920) (← links)
- Properties of the sample estimators used for statistical normalization of feature vectors (Q1715923) (← links)
- Size matters: choosing the most informative set of window lengths for mining patterns in event sequences (Q1715925) (← links)
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions (Q1741131) (← links)
- Exceptional model mining. Exceptional model mining, supervised descriptive local pattern mining with complex target concepts (Q1741133) (← links)
- On detecting maximal quasi antagonistic communities in signed graphs (Q1741135) (← links)
- Link prediction using time series of neighborhood-based node similarity scores (Q1741139) (← links)
- Sampling frequent and minimal Boolean patterns: theory and application in classification (Q1741140) (← links)
- A computational approach inspired by simulated annealing to study the stability of protein interaction networks in cancer and neurological disorders (Q1741144) (← links)
- Accelerating the discovery of unsupervised-shapelets (Q1741145) (← links)
- Using dynamic time warping distances as features for improved time series classification (Q1741147) (← links)
- Instance-level accuracy versus bag-level accuracy in multi-instance learning (Q1741150) (← links)
- Classification of streaming time series under more realistic assumptions (Q1741151) (← links)
- Fast approximation of betweenness centrality through sampling (Q1741154) (← links)
- Time series representation and similarity based on local autopatterns (Q1741155) (← links)
- Active exploration for large graphs (Q1741157) (← links)
- Fast exhaustive subgroup discovery with numerical target concepts (Q1741161) (← links)
- Retrieving geometric information from images: the case of hand-drawn diagrams (Q1741163) (← links)
- Scalable density-based clustering with quality guarantees using random projections (Q1741164) (← links)
- Enhancing social collaborative filtering through the application of non-negative matrix factorization and exponential random graph models (Q1741167) (← links)
- The PRIMPING routine -- tiling through proximal alternating linearized minimization (Q1741169) (← links)
- Robust unsupervised cluster matching for network data (Q1741172) (← links)
- Do your friends make you buy this brand? Modeling social recommendation with topics and brands (Q1741228) (← links)
- Exploiting the roles of aspects in personalized POI recommender systems (Q1741230) (← links)
- Infinite ensemble clustering (Q1741232) (← links)
- Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking (Q1741234) (← links)
- An improvement of the parameterized frequent directions algorithm (Q1741237) (← links)
- Robust graph regularized nonnegative matrix factorization for clustering (Q1741239) (← links)
- Fast analytical methods for finding significant labeled graph motifs (Q1741244) (← links)
- Efficient geometric-based computation of the string subsequence kernel (Q1741246) (← links)
- Evaluating discrete choice prediction models when the evaluation data is corrupted: analytic results and bias corrections for the area under the ROC (Q1741248) (← links)
