{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/clustering/papers/81","list_of":"/task/clustering","task":"Clustering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":81,"pages_in_order":108,"rows_per_page":100,"rows":[8001,8100],"of":10718,"counts":{"archive_papers_tagged":10718,"with_a_code_link":2823,"where_syntology_ran_a_sample":419,"not_listed_spam_title":0,"listed":10718,"listed_where_code_ran":419,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":335,"every_run_a_failure_of_syntologys_instrument":84,"listed_with_a_run_with_no_instrument_failure":335,"listed_every_run_a_failure_of_syntologys_instrument":84,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/clustering","prev":"/task/clustering/papers/80","next":"/task/clustering/papers/82","papers":[{"url":null,"slug":"enhancing-keyword-correlation-for-event","title":"Enhancing keyword correlation for event detection in social networks using SVD and k-means: Twitter case study","date":"2018-07-25","arxiv_id":"1807.09561","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-to-fundamental-uncertainty-in-agi","title":"Robustness to fundamental uncertainty in AGI alignment","date":"2018-07-25","arxiv_id":"1807.09836","repositories_listed":0,"syntology":null},{"url":null,"slug":"clusternet-3d-instance-segmentation-in-rgb-d","title":"ClusterNet: 3D Instance Segmentation in RGB-D Images","date":"2018-07-24","arxiv_id":"1807.08894","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-local-low-rank-cube-based-tensor","title":"Non-local Low-rank Cube-based Tensor Factorization for Spectral CT Reconstruction","date":"2018-07-24","arxiv_id":"1807.10610","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-continuous-state-pomdp-planning-with","title":"Optimal Continuous State POMDP Planning with Semantic Observations: A Variational Approach","date":"2018-07-22","arxiv_id":"1807.08229","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-density-based-clustering-with-a","title":"Linear density-based clustering with a discrete density model","date":"2018-07-21","arxiv_id":"1807.08158","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximating-k-ell-center-clustering-for","title":"Approximating $(k,\\ell)$-center clustering for curves","date":"2018-07-20","arxiv_id":"1805.01547","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-task-allocation-in-multi-robot","title":"Decentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering","date":"2018-07-20","arxiv_id":"1807.07957","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-facial-representations-for-age","title":"Efficient Facial Representations for Age, Gender and Identity Recognition in Organizing Photo Albums using Multi-output CNN","date":"2018-07-20","arxiv_id":"1807.07718","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-document-clustering-on-named-entity","title":"Semantic Document Clustering on Named Entity Features","date":"2018-07-20","arxiv_id":"1807.07777","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-collapsed-gibbs-clustering-with","title":"Approximate Collapsed Gibbs Clustering with Expectation Propagation","date":"2018-07-19","arxiv_id":"1807.07621","repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-recovery-bounds-for-clustering-with","title":"Partial recovery bounds for clustering with the relaxed $K$means","date":"2018-07-19","arxiv_id":"1807.07547","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-schemes-for-low-rank-binary","title":"Approximation Schemes for Low-Rank Binary Matrix Approximation Problems","date":"2018-07-18","arxiv_id":"1807.07156","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-macroeconomic-time-series","title":"Clustering Macroeconomic Time Series","date":"2018-07-18","arxiv_id":"1807.04004","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-study-of-discrete-wavelet","title":"Comparative study of Discrete Wavelet Transforms and Wavelet Tensor Train decomposition to feature extraction of FTIR data of medicinal plants","date":"2018-07-18","arxiv_id":"1807.07099","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-semantic-clustering-to-support","title":"Using semantic clustering to support situation awareness on Twitter: The case of World Views","date":"2018-07-17","arxiv_id":"1807.06588","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-and-modeling-of-behavioral-changes","title":"Analysis and Modeling of Behavioral Changes in a News Service","date":"2018-07-16","arxiv_id":"1807.06060","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-data-slicing-for-model-validationa","title":"Automated Data Slicing for Model Validation:A Big data - AI Integration Approach","date":"2018-07-16","arxiv_id":"1807.06068","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-feature-based-clustering-of-micro-panel","title":"Novel Feature-Based Clustering of Micro-Panel Data (CluMP)","date":"2018-07-16","arxiv_id":"1807.05926","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-salt-and-pepper-noise-image-denoising","title":"A salt and pepper noise image denoising method based on the generative classification","date":"2018-07-15","arxiv_id":"1807.05478","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarially-learned-mixture-model","title":"Adversarially Learned Mixture Model","date":"2018-07-14","arxiv_id":"1807.05344","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-contact-and-motion-from","title":"Extracting Contact and Motion from Manipulation Videos","date":"2018-07-13","arxiv_id":"1807.04870","repositories_listed":0,"syntology":null},{"url":null,"slug":"forecasting-market-states","title":"Forecasting market states","date":"2018-07-13","arxiv_id":"1807.05836","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-representations-by-dendrograms","title":"Learning Graph Representations by Dendrograms","date":"2018-07-13","arxiv_id":"1807.05087","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-clustering-on-compressed-data","title":"Decentralized Clustering on Compressed Data without Prior Knowledge of the Number of Clusters","date":"2018-07-12","arxiv_id":"1807.04566","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-punishment-voting-algorithm-based-on-super","title":"A punishment voting algorithm based on super categories construction for acoustic scene classification","date":"2018-07-11","arxiv_id":"1807.04073","repositories_listed":0,"syntology":null},{"url":null,"slug":"agglomerative-hierarchical-clustering","title":"Agglomerative Hierarchical Clustering Analysis of co/multi-morbidities","date":"2018-07-11","arxiv_id":"1807.04325","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepmove-learning-place-representations","title":"DeepMove: Learning Place Representations through Large Scale Movement Data","date":"2018-07-11","arxiv_id":"1807.04241","repositories_listed":0,"syntology":null},{"url":null,"slug":"essential-tensor-learning-for-multi-view","title":"Essential Tensor Learning for Multi-view Spectral Clustering","date":"2018-07-10","arxiv_id":"1807.03602","repositories_listed":0,"syntology":null},{"url":null,"slug":"pairwise-covariates-adjusted-block-model-for","title":"Pairwise Covariates-adjusted Block Model for Community Detection","date":"2018-07-10","arxiv_id":"1807.03469","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-sparse-subspace-clustering-via","title":"Scalable Sparse Subspace Clustering via Ordered Weighted $\\ell_1$ Regression","date":"2018-07-10","arxiv_id":"1807.03746","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-should-we-correctly-compare-multiple","title":"Tractable $n$-Metrics for Multiple Graphs","date":"2018-07-09","arxiv_id":"1807.03368","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-clustering-and-multi-target","title":"Real-time clustering and multi-target tracking using event-based sensors","date":"2018-07-08","arxiv_id":"1807.02851","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-modal-age-of-statistics","title":"The modal age of Statistics","date":"2018-07-08","arxiv_id":"1807.02789","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-graph-based-clustering-for","title":"Temporal graph-based clustering for historical record linkage","date":"2018-07-06","arxiv_id":"1807.02262","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-synthetic-but-plausible-healthcare","title":"Generating Synthetic but Plausible Healthcare Record Datasets","date":"2018-07-04","arxiv_id":"1807.01514","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-temporal-constraints-on","title":"Clustering with Temporal Constraints on Spatio-Temporal Data of Human Mobility","date":"2018-07-02","arxiv_id":"1807.00546","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-extraction-of-causal-relations-from","title":"Automatic Extraction of Causal Relations from Text using Linguistically Informed Deep Neural Networks","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-12-approximation-for-submodular-1","title":"Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"craftml-an-efficient-clustering-based-random","title":"CRAFTML, an Efficient Clustering-based Random Forest for Extreme Multi-label Learning","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-clustering-via-lsh-based-data","title":"Distributed Clustering via LSH Based Data Partitioning","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"k-means-clustering-using-random-matrix","title":"K-means clustering using random matrix sparsification","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-thematic-similarity-metric-from","title":"Learning Thematic Similarity Metric from Article Sections Using Triplet Networks","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-riemannian-optimization-on-positive","title":"Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"massively-parallel-algorithms-and-hardness","title":"Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under $\\ell_p$ Distances","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multilingual-short-text-responses-clustering","title":"Multilingual Short Text Responses Clustering for Mobile Educational Activities: a Preliminary Exploration","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"partial-optimality-and-fast-lower-bounds-for","title":"Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-variable-selection-for-streaming","title":"Provable Variable Selection for Streaming Features","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sentence-suggestion-of-japanese-functional","title":"Sentence Suggestion of Japanese Functional Expressions for Chinese-speaking Learners","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"smac-simultaneous-mapping-and-clustering","title":"SMAC: Simultaneous Mapping and Clustering Using Spectral Decompositions","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-summa-platform-a-scalable-infrastructure","title":"The SUMMA Platform: A Scalable Infrastructure for Multi-lingual Multi-media Monitoring","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-counselor-dialogue-clustering","title":"Unsupervised Counselor Dialogue Clustering for Positive Emotion Elicitation in Neural Dialogue System","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"certifying-global-optimality-of-graph-cuts","title":"Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering","date":"2018-06-29","arxiv_id":"1806.11429","repositories_listed":0,"syntology":null},{"url":null,"slug":"grapevine-a-wine-prediction-algorithm-using","title":"Grapevine: A Wine Prediction Algorithm Using Multi-dimensional Clustering Methods","date":"2018-06-29","arxiv_id":"1807.00692","repositories_listed":0,"syntology":null},{"url":"/paper/a-probabilistic-constrained-clustering-for","slug":"a-probabilistic-constrained-clustering-for","title":"A probabilistic constrained clustering for transfer learning and image category discovery","date":"2018-06-28","arxiv_id":"1806.11078","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-trees-with-convex-clustering","title":"Recovering Trees with Convex Clustering","date":"2018-06-28","arxiv_id":"1806.11096","repositories_listed":0,"syntology":null},{"url":null,"slug":"successive-convex-approximation-algorithms","title":"Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations","date":"2018-06-28","arxiv_id":"1806.10773","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-pedestrian-motion-prediction-in","title":"Context-Aware Pedestrian Motion Prediction In Urban Intersections","date":"2018-06-25","arxiv_id":"1806.09453","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-cellular-feature-differences-of","title":"Analysis of Cellular Feature Differences of Astrocytomas with Distinct Mutational Profiles Using Digitized Histopathology Images","date":"2018-06-24","arxiv_id":"1806.09093","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-simple-linear-iterative-clustering","title":"Scalable Simple Linear Iterative Clustering (SSLIC) Using a Generic and Parallel Approach","date":"2018-06-22","arxiv_id":"1806.08741","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-based-clustering-for-identifying","title":"Model-based clustering for identifying disease-associated SNPs in case-control genome-wide association studies","date":"2018-06-21","arxiv_id":"1806.08456","repositories_listed":0,"syntology":null},{"url":null,"slug":"sampling-clustering","title":"Reductive Clustering: An Efficient Linear-time Graph-based Divisive Cluster Analysis Approach","date":"2018-06-21","arxiv_id":"1806.08245","repositories_listed":0,"syntology":null},{"url":null,"slug":"defrag-deep-euclidean-feature-representations","title":"DEFRAG: Deep Euclidean Feature Representations through Adaptation on the Grassmann Manifold","date":"2018-06-20","arxiv_id":"1806.07688","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-news-events-from-microblogs","title":"Extracting News Events from Microblogs","date":"2018-06-20","arxiv_id":"1806.07573","repositories_listed":0,"syntology":null},{"url":null,"slug":"mean-field-analysis-of-personalized-pagerank","title":"Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering","date":"2018-06-20","arxiv_id":"1806.07640","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-weighted-multiple-kernel-learning-for","title":"Self-weighted Multiple Kernel Learning for Graph-based Clustering and Semi-supervised Classification","date":"2018-06-20","arxiv_id":"1806.07697","repositories_listed":0,"syntology":null},{"url":null,"slug":"applications-of-data-mining-techniques-for","title":"Applications of Data Mining Techniques for Vehicular Ad hoc Networks","date":"2018-06-19","arxiv_id":"1807.02564","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-multi-graph-embedding-for-brain","title":"Multi-View Multi-Graph Embedding for Brain Network Clustering Analysis","date":"2018-06-19","arxiv_id":"1806.07703","repositories_listed":0,"syntology":null},{"url":null,"slug":"overlapping-clustering-models-and-one-class","title":"Overlapping Clustering Models, and One (class) SVM to Bind Them All","date":"2018-06-18","arxiv_id":"1806.06945","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-policy-representations-in-multiagent","title":"Learning Policy Representations in Multiagent Systems","date":"2018-06-17","arxiv_id":"1806.06464","repositories_listed":0,"syntology":null},{"url":null,"slug":"morse-theory-and-an-impossibility-theorem-for","title":"Possibility results for graph clustering: A novel consistency axiom","date":"2018-06-15","arxiv_id":"1806.06142","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-k-means-clustering-and-the-double-dixie","title":"Query K-means Clustering and the Double Dixie Cup Problem","date":"2018-06-15","arxiv_id":"1806.05938","repositories_listed":0,"syntology":null},{"url":null,"slug":"rapidnn-in-memory-deep-neural-network","title":"RAPIDNN: In-Memory Deep Neural Network Acceleration Framework","date":"2018-06-15","arxiv_id":"1806.05794","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-fuzzy-partitioning","title":"Supervised Fuzzy Partitioning","date":"2018-06-15","arxiv_id":"1806.06124","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-density-based-spatio-textual","title":"Improved Density-Based Spatio--Textual Clustering on Social Media","date":"2018-06-14","arxiv_id":"1806.05522","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-neural-network-compression-and","title":"Scalable Neural Network Compression and Pruning Using Hard Clustering and L1 Regularization","date":"2018-06-14","arxiv_id":"1806.05355","repositories_listed":0,"syntology":null},{"url":null,"slug":"scsp-spectral-clustering-filter-pruning-with","title":"SCSP: Spectral Clustering Filter Pruning with Soft Self-adaption Manners","date":"2018-06-14","arxiv_id":"1806.05320","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-formation-of-the-structure-of","title":"Automatic formation of the structure of abstract machines in hierarchical reinforcement learning with state clustering","date":"2018-06-13","arxiv_id":"1806.05292","repositories_listed":0,"syntology":null},{"url":null,"slug":"crowd-powered-data-mining","title":"Crowd-Powered Data Mining","date":"2018-06-13","arxiv_id":"1806.04968","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-inference-for-cluster-based","title":"High-Dimensional Inference for Cluster-Based Graphical Models","date":"2018-06-13","arxiv_id":"1806.05139","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-shoot-in-first-person-shooter","title":"Learning to Shoot in First Person Shooter Games by Stabilizing Actions and Clustering Rewards for Reinforcement Learning","date":"2018-06-13","arxiv_id":"1806.05117","repositories_listed":0,"syntology":null},{"url":null,"slug":"pattern-dependence-detection-using-n-tarp","title":"Pattern Dependence Detection using n-TARP Clustering","date":"2018-06-13","arxiv_id":"1806.05297","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantically-selective-augmentation-for-deep","title":"Semantically Selective Augmentation for Deep Compact Person Re-Identification","date":"2018-06-11","arxiv_id":"1806.04074","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-scalable-framework-for-trajectory","title":"A Scalable Framework for Trajectory Prediction","date":"2018-06-10","arxiv_id":"1806.03582","repositories_listed":0,"syntology":null},{"url":null,"slug":"dir-st2-delineation-of-imprecise-regions","title":"DIR-ST$^2$: Delineation of Imprecise Regions Using Spatio--Temporal--Textual Information","date":"2018-06-09","arxiv_id":"1806.03482","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-with-prior-knowledge","title":"Hierarchical Clustering with Prior Knowledge","date":"2018-06-09","arxiv_id":"1806.03432","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervisory-signals-for-object-discovery","title":"Self-supervisory Signals for Object Discovery and Detection","date":"2018-06-08","arxiv_id":"1806.03370","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-optimal-transport-on-a-graph","title":"Randomized Optimal Transport on a Graph: framework and new distance measures","date":"2018-06-07","arxiv_id":"1806.03232","repositories_listed":0,"syntology":null},{"url":null,"slug":"segment-based-credit-scoring-using-latent","title":"Segment-Based Credit Scoring Using Latent Clusters in the Variational Autoencoder","date":"2018-06-07","arxiv_id":"1806.02538","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-learning-via-compact-latent","title":"Semi-Supervised Learning via Compact Latent Space Clustering","date":"2018-06-07","arxiv_id":"1806.02679","repositories_listed":0,"syntology":null},{"url":null,"slug":"normalized-cut-with-adaptive-similarity-and","title":"A Variational Image Segmentation Model based on Normalized Cut with Adaptive Similarity and Spatial Regularization","date":"2018-06-06","arxiv_id":"1806.01977","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-visual-quality-index-for-fuzzy-c-means","title":"A Visual Quality Index for Fuzzy C-Means","date":"2018-06-05","arxiv_id":"1806.01552","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-clustering-with-neural","title":"Semi-Supervised Clustering with Neural Networks","date":"2018-06-05","arxiv_id":"1806.01547","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-confidence-and-smoothness","title":"Adversarial confidence and smoothness regularizations for scalable unsupervised discriminative learning","date":"2018-06-04","arxiv_id":"1806.00919","repositories_listed":0,"syntology":null},{"url":null,"slug":"almn-deep-embedding-learning-with-geometrical","title":"ALMN: Deep Embedding Learning with Geometrical Virtual Point Generating","date":"2018-06-04","arxiv_id":"1806.00974","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-clustering-of-a-network-protocol","title":"Automatic Clustering of a Network Protocol with Weakly-Supervised Clustering","date":"2018-06-04","arxiv_id":"1806.00981","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-the-spatial-probability-of","title":"Computing the Spatial Probability of Inclusion inside Partial Contours for Computer Vision Applications","date":"2018-06-04","arxiv_id":"1806.01339","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-and-generalizing-motion-primitives","title":"Learning and Generalizing Motion Primitives from Driving Data for Path-Tracking Applications","date":"2018-06-02","arxiv_id":"1806.00711","repositories_listed":0,"syntology":null},{"url":null,"slug":"locally-interpretable-models-and-effects","title":"Locally Interpretable Models and Effects based on Supervised Partitioning (LIME-SUP)","date":"2018-06-02","arxiv_id":"1806.00663","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-clustering-under-uncertainty","title":"Optimal Clustering under Uncertainty","date":"2018-06-02","arxiv_id":"1806.00672","repositories_listed":0,"syntology":null}],"record_sha256":"eeb8eb06730ad8476037f8dd4052d030e334238201520d445c2c3a8def1d0e25","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}