Crowdsourcing Utilizing Subgroup Structure of Latent Factor Modeling
From MaRDI portal
Publication:6567912
Cites work
- scientific article; zbMATH DE number 1157171 (Why is no real title available?)
- A feasible method for optimization with orthogonality constraints
- Bayesian aggregation of order-based rank data
- Co-clustering directed graphs to discover asymmetries and directional communities
- Cross-validation:a review2
- Directed Community Detection With Network Embedding
- Estimating the number of clusters in a data set via the gap statistic
- Finding the Number of Clusters in a Dataset
- Individualized Multidirectional Variable Selection
- Optimal Decision Rules in Uncertain Dichotomous Choice Situations
- Polytomous logistic regression
- Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
- Sparsity and Smoothness Via the Fused Lasso
- Spectral methods meet EM: a provably optimal algorithm for crowdsourcing
- The Hat Matrix in Regression and ANOVA
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- Tuning parameter selectors for the smoothly clipped absolute deviation method
- Visualizing data using t-SNE
This page was built for publication: Crowdsourcing Utilizing Subgroup Structure of Latent Factor Modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567912)