{"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/25","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":25,"pages_in_order":108,"rows_per_page":100,"rows":[2401,2500],"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/24","next":"/task/clustering/papers/26","papers":[{"url":"/paper/deep-density-based-image-clustering","slug":"deep-density-based-image-clustering","title":"Deep Density-based Image Clustering","date":"2018-12-11","arxiv_id":"1812.04287","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-kernel-sparsity-and-entropy-for","slug":"exploiting-kernel-sparsity-and-entropy-for","title":"Exploiting Kernel Sparsity and Entropy for Interpretable CNN Compression","date":"2018-12-11","arxiv_id":"1812.04368","repositories_listed":1,"syntology":null},{"url":"/paper/object-centric-auto-encoders-and-dummy","slug":"object-centric-auto-encoders-and-dummy","title":"Object-centric Auto-encoders and Dummy Anomalies for Abnormal Event Detection in Video","date":"2018-12-11","arxiv_id":"1812.04960","repositories_listed":1,"syntology":{"n":21,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/object-centric-auto-encoders-and-dummy#ran","syntology_url":"https://syntology.ai/paper/1812.04960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.04960"}},"official":null}},{"url":"/paper/disentangling-disentanglement-in-variational","slug":"disentangling-disentanglement-in-variational","title":"Disentangling Disentanglement in Variational Autoencoders","date":"2018-12-06","arxiv_id":"1812.02833","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-networks-from-random-walk-based","slug":"inferring-networks-from-random-walk-based","title":"Inferring Networks From Random Walk-Based Node Similarities","date":"2018-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-convolutional-neural-networks","slug":"structure-aware-convolutional-neural-networks","title":"Structure-Aware Convolutional Neural Networks","date":"2018-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/distributed-dual-vigilance-fuzzy-adaptive","slug":"distributed-dual-vigilance-fuzzy-adaptive","title":"Distributed dual vigilance fuzzy adaptive resonance theory learns online, retrieves arbitrarily-shaped clusters, and mitigates order dependence","date":"2018-11-28","arxiv_id":"1901.00794","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-clustering-in-heterogeneous","slug":"higher-order-clustering-in-heterogeneous","title":"User-Guided Clustering in Heterogeneous Information Networks via Motif-Based Comprehensive Transcription","date":"2018-11-28","arxiv_id":"1811.11320","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-part-detection-via-matching-learning","slug":"semantic-part-detection-via-matching-learning","title":"Semantic Part Detection via Matching: Learning to Generalize to Novel Viewpoints from Limited Training Data","date":"2018-11-28","arxiv_id":"1811.11823","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/semantic-part-detection-via-matching-learning#ran","syntology_url":"https://syntology.ai/paper/1811.11823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11823"}},"official":{"repos":["ytongbai/SemanticPartDetection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/node-embedding-with-adaptive-similarities-for","slug":"node-embedding-with-adaptive-similarities-for","title":"Node Embedding with Adaptive Similarities for Scalable Learning over Graphs","date":"2018-11-27","arxiv_id":"1811.10797","repositories_listed":1,"syntology":null},{"url":"/paper/3d-lanenet-end-to-end-3d-multiple-lane","slug":"3d-lanenet-end-to-end-3d-multiple-lane","title":"3D-LaneNet: End-to-End 3D Multiple Lane Detection","date":"2018-11-26","arxiv_id":"1811.10203","repositories_listed":1,"syntology":null},{"url":"/paper/deep-bayesian-self-training","slug":"deep-bayesian-self-training","title":"Deep Bayesian Self-Training","date":"2018-11-26","arxiv_id":"1812.01681","repositories_listed":1,"syntology":null},{"url":"/paper/one-shot-domain-adaptation-for-person-re","slug":"one-shot-domain-adaptation-for-person-re","title":"Self-similarity Grouping: A Simple Unsupervised Cross Domain Adaptation Approach for Person Re-identification","date":"2018-11-26","arxiv_id":"1811.10144","repositories_listed":1,"syntology":null},{"url":"/paper/amortized-bayesian-inference-for-clustering","slug":"amortized-bayesian-inference-for-clustering","title":"Amortized Bayesian inference for clustering models","date":"2018-11-24","arxiv_id":"1811.09747","repositories_listed":1,"syntology":null},{"url":"/paper/clubmark-a-parallel-isolation-framework-for","slug":"clubmark-a-parallel-isolation-framework-for","title":"Clubmark: a Parallel Isolation Framework for Benchmarking and Profiling Clustering Algorithms on NUMA Architectures","date":"2018-11-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/subspace-clustering-through-sub-clusters","slug":"subspace-clustering-through-sub-clusters","title":"Subspace Clustering through Sub-Clusters","date":"2018-11-15","arxiv_id":"1811.06580","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-binary-multiway-data","slug":"learning-from-binary-multiway-data","title":"Learning from Binary Multiway Data: Probabilistic Tensor Decomposition and its Statistical Optimality","date":"2018-11-13","arxiv_id":"1811.05076","repositories_listed":1,"syntology":null},{"url":"/paper/a-test-case-for-application-of-convolutional","slug":"a-test-case-for-application-of-convolutional","title":"A test case for application of convolutional neural networks to spatio-temporal climate data: Re-identifying clustered weather patterns","date":"2018-11-12","arxiv_id":"1811.04817","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-backdoor-attacks-on-deep-neural","slug":"detecting-backdoor-attacks-on-deep-neural","title":"Detecting Backdoor Attacks on Deep Neural Networks by Activation Clustering","date":"2018-11-09","arxiv_id":"1811.03728","repositories_listed":1,"syntology":null},{"url":"/paper/evidence-transfer-for-improving-clustering","slug":"evidence-transfer-for-improving-clustering","title":"Evidence Transfer for Improving Clustering Tasks Using External Categorical Evidence","date":"2018-11-09","arxiv_id":"1811.03909","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-and-unsupervised-subword","slug":"multilingual-and-unsupervised-subword","title":"Multilingual and Unsupervised Subword Modeling for Zero-Resource Languages","date":"2018-11-09","arxiv_id":"1811.04791","repositories_listed":1,"syntology":null},{"url":"/paper/fast-high-dimensional-bilateral-and-nonlocal","slug":"fast-high-dimensional-bilateral-and-nonlocal","title":"Fast High-Dimensional Bilateral and Nonlocal Means Filtering","date":"2018-11-06","arxiv_id":"1811.02363","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-deep-clustering-for-source","slug":"unsupervised-deep-clustering-for-source","title":"Unsupervised Deep Clustering for Source Separation: Direct Learning from Mixtures using Spatial Information","date":"2018-11-05","arxiv_id":"1811.01531","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-deep-clustering-for-source#ran","syntology_url":"https://syntology.ai/paper/1811.01531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.01531"}},"official":{"repos":["etzinis/unsupervised_spatial_dc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/foundations-of-comparison-based-hierarchical","slug":"foundations-of-comparison-based-hierarchical","title":"Foundations of Comparison-Based Hierarchical Clustering","date":"2018-11-02","arxiv_id":"1811.00928","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/foundations-of-comparison-based-hierarchical#ran","syntology_url":"https://syntology.ai/paper/1811.00928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00928"}},"official":{"repos":["mperrot/ComparisonHC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-enhanced-stochastic-gradient-mcmc","slug":"clustering-enhanced-stochastic-gradient-mcmc","title":"Targeted stochastic gradient Markov chain Monte Carlo for hidden Markov models with rare latent states","date":"2018-10-31","arxiv_id":"1810.13431","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-laplacian-k-modes","slug":"scalable-laplacian-k-modes","title":"Scalable Laplacian K-modes","date":"2018-10-31","arxiv_id":"1810.13044","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-laplacian-k-modes#ran","syntology_url":"https://syntology.ai/paper/1810.13044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.13044"}},"official":{"repos":["imtiazziko/SLK"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-crowdsourced-clustering-with-deep","slug":"semi-crowdsourced-clustering-with-deep","title":"Semi-crowdsourced Clustering with Deep Generative Models","date":"2018-10-29","arxiv_id":"1810.11971","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-for-binary-featured-datasets","slug":"clustering-for-binary-featured-datasets","title":"Clustering for Binary Featured Datasets","date":"2018-10-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spectral-embedding-norm-looking-deep-into-the","slug":"spectral-embedding-norm-looking-deep-into-the","title":"Spectral Embedding Norm: Looking Deep into the Spectrum of the Graph Laplacian","date":"2018-10-25","arxiv_id":"1810.10695","repositories_listed":1,"syntology":null},{"url":"/paper/a-binary-optimization-approach-for","slug":"a-binary-optimization-approach-for","title":"A Binary Optimization Approach for Constrained K-Means Clustering","date":"2018-10-24","arxiv_id":"1810.10134","repositories_listed":1,"syntology":null},{"url":"/paper/graph-laplacian-mixture-model","slug":"graph-laplacian-mixture-model","title":"Graph Laplacian mixture model","date":"2018-10-23","arxiv_id":"1810.10053","repositories_listed":1,"syntology":null},{"url":"/paper/compositional-coding-capsule-network-with-k","slug":"compositional-coding-capsule-network-with-k","title":"Compositional Coding Capsule Network with K-Means Routing for Text Classification","date":"2018-10-22","arxiv_id":"1810.09177","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-scalable-image-clustering-based","slug":"accurate-and-scalable-image-clustering-based","title":"Accurate and Scalable Image Clustering Based On Sparse Representation of Camera Fingerprint","date":"2018-10-18","arxiv_id":"1810.07945","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-k-clustering-for-data-with-heavy","slug":"distributed-k-clustering-for-data-with-heavy","title":"Distributed $k$-Clustering for Data with Heavy Noise","date":"2018-10-18","arxiv_id":"1810.07852","repositories_listed":1,"syntology":null},{"url":"/paper/reverse-engineering-of-cad-models-via","slug":"reverse-engineering-of-cad-models-via","title":"Reverse engineering of CAD models via clustering and approximate implicitization","date":"2018-10-17","arxiv_id":"1810.07451","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-multireference-alignment-for","slug":"heterogeneous-multireference-alignment-for","title":"Heterogeneous multireference alignment for images with application to 2-D classification in single particle reconstruction","date":"2018-10-12","arxiv_id":"1811.10382","repositories_listed":1,"syntology":null},{"url":"/paper/fully-supervised-speaker-diarization","slug":"fully-supervised-speaker-diarization","title":"Fully Supervised Speaker Diarization","date":"2018-10-10","arxiv_id":"1810.04719","repositories_listed":1,"syntology":null},{"url":"/paper/decipherment-of-historical-manuscript-images","slug":"decipherment-of-historical-manuscript-images","title":"Decipherment of Historical Manuscript Images","date":"2018-10-09","arxiv_id":"1810.04297","repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-on-the-link-between","slug":"deep-clustering-on-the-link-between","title":"Deep clustering: On the link between discriminative models and K-means","date":"2018-10-09","arxiv_id":"1810.04246","repositories_listed":1,"syntology":null},{"url":"/paper/an-ensemble-based-on-a-bi-objective","slug":"an-ensemble-based-on-a-bi-objective","title":"An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering","date":"2018-10-08","arxiv_id":"1810.03652","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-clustering-that-takes-advantage","slug":"hierarchical-clustering-that-takes-advantage","title":"Hierarchical clustering that takes advantage of both density-peak and density-connectivity","date":"2018-10-08","arxiv_id":"1810.03393","repositories_listed":1,"syntology":null},{"url":"/paper/cdf-transform-shift-an-effective-way-to-deal","slug":"cdf-transform-shift-an-effective-way-to-deal","title":"CDF Transform-and-Shift: An effective way to deal with datasets of inhomogeneous cluster densities","date":"2018-10-05","arxiv_id":"1810.02897","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-weakly-supervised-word-sense","slug":"integrating-weakly-supervised-word-sense","title":"Integrating Weakly Supervised Word Sense Disambiguation into Neural Machine Translation","date":"2018-10-05","arxiv_id":"1810.02614","repositories_listed":1,"syntology":null},{"url":"/paper/disambiguating-music-artists-at-scale-with","slug":"disambiguating-music-artists-at-scale-with","title":"Disambiguating Music Artists at Scale with Audio Metric Learning","date":"2018-10-03","arxiv_id":"1810.01807","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-clustering-algorithm-based-on","slug":"real-time-clustering-algorithm-based-on","title":"Determining Optimal Number of k-Clusters based on Predefined Level-of-Similarity","date":"2018-10-03","arxiv_id":"1810.01878","repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-training-of-large-scale-gaussian","slug":"accelerated-training-of-large-scale-gaussian","title":"Large Scale Clustering with Variational EM for Gaussian Mixture Models","date":"2018-10-01","arxiv_id":"1810.00803","repositories_listed":1,"syntology":null},{"url":"/paper/facts-that-matter","slug":"facts-that-matter","title":"Facts That Matter","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modeling-uncertainty-with-hedged-instance","slug":"modeling-uncertainty-with-hedged-instance","title":"Modeling Uncertainty with Hedged Instance Embedding","date":"2018-09-30","arxiv_id":"1810.00319","repositories_listed":1,"syntology":null},{"url":"/paper/causal-inference-and-mechanism-clustering-of","slug":"causal-inference-and-mechanism-clustering-of","title":"Causal Inference and Mechanism Clustering of A Mixture of Additive Noise Models","date":"2018-09-23","arxiv_id":"1809.08568","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/causal-inference-and-mechanism-clustering-of#ran","syntology_url":"https://syntology.ai/paper/1809.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.08568"}},"official":{"repos":["amber0309/ANM-MM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/non-linear-attributed-graph-clustering-by","slug":"non-linear-attributed-graph-clustering-by","title":"Non-linear Attributed Graph Clustering by Symmetric NMF with PU Learning","date":"2018-09-21","arxiv_id":"1810.00946","repositories_listed":1,"syntology":null},{"url":"/paper/visual-diver-recognition-for-underwater-human","slug":"visual-diver-recognition-for-underwater-human","title":"Visual Diver Recognition for Underwater Human-Robot Collaboration","date":"2018-09-19","arxiv_id":"1809.10201","repositories_listed":1,"syntology":null},{"url":"/paper/triad-based-neural-network-for-coreference","slug":"triad-based-neural-network-for-coreference","title":"Triad-based Neural Network for Coreference Resolution","date":"2018-09-18","arxiv_id":"1809.06491","repositories_listed":1,"syntology":null},{"url":"/paper/random-warping-series-a-random-features","slug":"random-warping-series-a-random-features","title":"Random Warping Series: A Random Features Method for Time-Series Embedding","date":"2018-09-14","arxiv_id":"1809.05259","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-label-smoothing-regularization-for","slug":"sparse-label-smoothing-regularization-for","title":"Sparse Label Smoothing Regularization for Person Re-Identification","date":"2018-09-13","arxiv_id":"1809.04976","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-networks-for-fast","slug":"convolutional-neural-networks-for-fast","title":"Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching","date":"2018-09-10","arxiv_id":"1809.04440","repositories_listed":1,"syntology":null},{"url":"/paper/a-fast-palette-reordering-technique-based-on","slug":"a-fast-palette-reordering-technique-based-on","title":"A Fast Palette Reordering Technique Based on GPU-Optimized Genetic Algorithms","date":"2018-09-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mixtures-of-skewed-matrix-variate-bilinear","slug":"mixtures-of-skewed-matrix-variate-bilinear","title":"Mixtures of Skewed Matrix Variate Bilinear Factor Analyzers","date":"2018-09-07","arxiv_id":"1809.02385","repositories_listed":1,"syntology":null},{"url":"/paper/a-tutorial-on-particle-swarm-optimization","slug":"a-tutorial-on-particle-swarm-optimization","title":"A tutorial on Particle Swarm Optimization Clustering","date":"2018-09-06","arxiv_id":"1809.01942","repositories_listed":1,"syntology":null},{"url":"/paper/casc-context-aware-segmentation-and","slug":"casc-context-aware-segmentation-and","title":"MASA: Motif-Aware State Assignment in Noisy Time Series Data","date":"2018-09-06","arxiv_id":"1809.01819","repositories_listed":1,"syntology":null},{"url":"/paper/content-based-propagation-of-user-markings","slug":"content-based-propagation-of-user-markings","title":"Content-based Propagation of User Markings for Interactive Segmentation of Patterned Images","date":"2018-09-06","arxiv_id":"1809.02226","repositories_listed":1,"syntology":null},{"url":"/paper/the-eurecom-submission-to-the-first-dihard","slug":"the-eurecom-submission-to-the-first-dihard","title":"The EURECOM Submission to the First DIHARD Challenge","date":"2018-09-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clustering-convolutional-kernels-to-compress","slug":"clustering-convolutional-kernels-to-compress","title":"Clustering Convolutional Kernels to Compress Deep Neural Networks","date":"2018-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/elastic-bands-across-the-path-a-new-framework","slug":"elastic-bands-across-the-path-a-new-framework","title":"Elastic bands across the path: A new framework and methods to lower bound DTW","date":"2018-08-29","arxiv_id":"1808.09617","repositories_listed":1,"syntology":null},{"url":"/paper/word-sense-induction-with-neural-bilm-and","slug":"word-sense-induction-with-neural-bilm-and","title":"Word Sense Induction with Neural biLM and Symmetric Patterns","date":"2018-08-26","arxiv_id":"1808.08518","repositories_listed":1,"syntology":null},{"url":"/paper/measuring-lda-topic-stability-from-clusters","slug":"measuring-lda-topic-stability-from-clusters","title":"Measuring LDA Topic Stability from Clusters of Replicated Runs","date":"2018-08-24","arxiv_id":"1808.08098","repositories_listed":1,"syntology":null},{"url":"/paper/self-paced-multi-task-clustering","slug":"self-paced-multi-task-clustering","title":"Self-Paced Multi-Task Clustering","date":"2018-08-24","arxiv_id":"1808.08068","repositories_listed":1,"syntology":null},{"url":"/paper/jldadmm-a-java-package-for-the-lda-and-dmm","slug":"jldadmm-a-java-package-for-the-lda-and-dmm","title":"jLDADMM: A Java package for the LDA and DMM topic models","date":"2018-08-11","arxiv_id":"1808.03835","repositories_listed":1,"syntology":null},{"url":"/paper/using-feature-grouping-as-a-stochastic","slug":"using-feature-grouping-as-a-stochastic","title":"Feature Grouping as a Stochastic Regularizer for High-Dimensional Structured Data","date":"2018-07-31","arxiv_id":"1807.11718","repositories_listed":1,"syntology":null},{"url":"/paper/naturalistic-driver-intention-and-path","slug":"naturalistic-driver-intention-and-path","title":"Naturalistic Driver Intention and Path Prediction using Recurrent Neural Networks","date":"2018-07-26","arxiv_id":"1807.09995","repositories_listed":1,"syntology":null},{"url":"/paper/selective-clustering-annotated-using-modes-of","slug":"selective-clustering-annotated-using-modes-of","title":"Selective Clustering Annotated using Modes of Projections","date":"2018-07-26","arxiv_id":"1807.10328","repositories_listed":1,"syntology":null},{"url":"/paper/semantically-meaningful-view-selection","slug":"semantically-meaningful-view-selection","title":"Semantically Meaningful View Selection","date":"2018-07-26","arxiv_id":"1807.10303","repositories_listed":1,"syntology":null},{"url":"/paper/improving-image-clustering-with-multiple","slug":"improving-image-clustering-with-multiple","title":"Improving Image Clustering With Multiple Pretrained CNN Feature Extractors","date":"2018-07-20","arxiv_id":"1807.07760","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-interaction-effects-between-prediction","slug":"on-the-interaction-effects-between-prediction","title":"On the Interaction Effects Between Prediction and Clustering","date":"2018-07-18","arxiv_id":"1807.06713","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-edge-detection-algorithm-for-multi","slug":"adaptive-edge-detection-algorithm-for-multi","title":"Adaptive edge detection algorithm for multi-focus application","date":"2018-07-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-coherent-structure-coloring","slug":"simultaneous-coherent-structure-coloring","title":"Simultaneous Coherent Structure Coloring facilitates interpretable clustering of scientific data by amplifying dissimilarity","date":"2018-07-12","arxiv_id":"1807.04427","repositories_listed":1,"syntology":null},{"url":"/paper/learning-neural-models-for-end-to-end","slug":"learning-neural-models-for-end-to-end","title":"Learning Neural Models for End-to-End Clustering","date":"2018-07-11","arxiv_id":"1807.04001","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-trajectory-recognition-in-active","slug":"automatic-trajectory-recognition-in-active","title":"Automatic trajectory recognition in Active Target Time Projection Chambers data by means of hierarchical clustering","date":"2018-07-10","arxiv_id":"1807.03513","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-auto-encoder-model-for-large-scale","slug":"recurrent-auto-encoder-model-for-large-scale","title":"Recurrent Auto-Encoder Model for Large-Scale Industrial Sensor Signal Analysis","date":"2018-07-10","arxiv_id":"1807.03710","repositories_listed":1,"syntology":null},{"url":"/paper/deep-co-clustering-for-unsupervised","slug":"deep-co-clustering-for-unsupervised","title":"Deep Multimodal Clustering for Unsupervised Audiovisual Learning","date":"2018-07-09","arxiv_id":"1807.03094","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-stochastic-graphlet-embedding","slug":"hierarchical-stochastic-graphlet-embedding","title":"Hierarchical stochastic graphlet embedding for graph-based pattern recognition","date":"2018-07-08","arxiv_id":"1807.02839","repositories_listed":1,"syntology":null},{"url":"/paper/cilantro-a-lean-versatile-and-efficient","slug":"cilantro-a-lean-versatile-and-efficient","title":"cilantro: A Lean, Versatile, and Efficient Library for Point Cloud Data Processing","date":"2018-07-01","arxiv_id":"1807.00399","repositories_listed":1,"syntology":null},{"url":"/paper/deep-k-means-re-training-and-parameter","slug":"deep-k-means-re-training-and-parameter","title":"Deep k-Means: Re-Training and Parameter Sharing with Harder Cluster Assignments for Compressing Deep Convolutions","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-flexible-model-for-training-action","slug":"a-flexible-model-for-training-action","title":"A flexible model for training action localization with varying levels of supervision","date":"2018-06-29","arxiv_id":"1806.11328","repositories_listed":1,"syntology":null},{"url":"/paper/factorizable-net-an-efficient-subgraph-based","slug":"factorizable-net-an-efficient-subgraph-based","title":"Factorizable Net: An Efficient Subgraph-based Framework for Scene Graph Generation","date":"2018-06-29","arxiv_id":"1806.11538","repositories_listed":1,"syntology":null},{"url":"/paper/on-embeddings-as-an-alternative-paradigm-for","slug":"on-embeddings-as-an-alternative-paradigm-for","title":"A Comparative Study of Distributional and Symbolic Paradigms for Relational Learning","date":"2018-06-29","arxiv_id":"1806.11391","repositories_listed":1,"syntology":null},{"url":"/paper/illuminating-generalization-in-deep","slug":"illuminating-generalization-in-deep","title":"Illuminating Generalization in Deep Reinforcement Learning through Procedural Level Generation","date":"2018-06-28","arxiv_id":"1806.10729","repositories_listed":1,"syntology":null},{"url":"/paper/piecewise-approximations-of-black-box-models","slug":"piecewise-approximations-of-black-box-models","title":"Optimal Piecewise Local-Linear Approximations","date":"2018-06-27","arxiv_id":"1806.10270","repositories_listed":1,"syntology":null},{"url":"/paper/deep-k-means-jointly-clustering-with-k-means","slug":"deep-k-means-jointly-clustering-with-k-means","title":"Deep $k$-Means: Jointly clustering with $k$-Means and learning representations","date":"2018-06-26","arxiv_id":"1806.10069","repositories_listed":1,"syntology":null},{"url":"/paper/deep-k-means-re-training-and-parameter-1","slug":"deep-k-means-re-training-and-parameter-1","title":"Deep $k$-Means: Re-Training and Parameter Sharing with Harder Cluster Assignments for Compressing Deep Convolutions","date":"2018-06-24","arxiv_id":"1806.09228","repositories_listed":1,"syntology":null},{"url":"/paper/infocatvae-representation-learning-with","slug":"infocatvae-representation-learning-with","title":"InfoCatVAE: Representation Learning with Categorical Variational Autoencoders","date":"2018-06-20","arxiv_id":"1806.08240","repositories_listed":1,"syntology":null},{"url":"/paper/neural-code-comprehension-a-learnable","slug":"neural-code-comprehension-a-learnable","title":"Neural Code Comprehension: A Learnable Representation of Code Semantics","date":"2018-06-19","arxiv_id":"1806.07336","repositories_listed":1,"syntology":null},{"url":"/paper/mlpack-3-a-fast-flexible-machine-learning","slug":"mlpack-3-a-fast-flexible-machine-learning","title":"mlpack 3: a fast, flexible machine learning library","date":"2018-06-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/robust-bayesian-model-selection-for-variable","slug":"robust-bayesian-model-selection-for-variable","title":"Robust Bayesian Model Selection for Variable Clustering with the Gaussian Graphical Model","date":"2018-06-15","arxiv_id":"1806.05924","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-interpretations-for-neural","slug":"hierarchical-interpretations-for-neural","title":"Hierarchical interpretations for neural network predictions","date":"2018-06-14","arxiv_id":"1806.05337","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-block-models-are-a-discrete","slug":"stochastic-block-models-are-a-discrete","title":"Stochastic Block Models are a Discrete Surface Tension","date":"2018-06-07","arxiv_id":"1806.02485","repositories_listed":1,"syntology":null},{"url":"/paper/degrees-of-freedom-and-model-selection-for","slug":"degrees-of-freedom-and-model-selection-for","title":"Degrees of Freedom and Model Selection for k-means Clustering","date":"2018-06-06","arxiv_id":"1806.02034","repositories_listed":1,"syntology":null},{"url":"/paper/grakel-a-graph-kernel-library-in-python","slug":"grakel-a-graph-kernel-library-in-python","title":"GraKeL: A Graph Kernel Library in Python","date":"2018-06-06","arxiv_id":"1806.02193","repositories_listed":1,"syntology":null},{"url":"/paper/medical-concept-embedding-with-time-aware","slug":"medical-concept-embedding-with-time-aware","title":"Medical Concept Embedding with Time-Aware Attention","date":"2018-06-06","arxiv_id":"1806.02873","repositories_listed":1,"syntology":null},{"url":"/paper/a-projection-method-for-metric-constrained","slug":"a-projection-method-for-metric-constrained","title":"A Projection Method for Metric-Constrained Optimization","date":"2018-06-05","arxiv_id":"1806.01678","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-regularized-spectral-clustering","slug":"understanding-regularized-spectral-clustering","title":"Understanding Regularized Spectral Clustering via Graph Conductance","date":"2018-06-05","arxiv_id":"1806.01468","repositories_listed":1,"syntology":null}],"record_sha256":"60c990d823ce254ad56e32fe31d29fc461113bb7198cfea774a7f078cdd4ef71","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}