{"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/17","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":17,"pages_in_order":108,"rows_per_page":100,"rows":[1601,1700],"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/16","next":"/task/clustering/papers/18","papers":[{"url":"/paper/adaptive-active-learning-for-coreference","slug":"adaptive-active-learning-for-coreference","title":"Adapting Coreference Resolution Models through Active Learning","date":"2021-04-15","arxiv_id":"2104.07611","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-hyperspectral-stimulated-raman","slug":"unsupervised-hyperspectral-stimulated-raman","title":"Unsupervised Hyperspectral Stimulated Raman Microscopy Image Enhancement: Denoising and Segmentation via One-Shot Deep Learning","date":"2021-04-14","arxiv_id":"2104.08338","repositories_listed":1,"syntology":null},{"url":"/paper/pose-invariant-person-re-identification-using","slug":"pose-invariant-person-re-identification-using","title":"Pose Invariant Person Re-Identification using Robust Pose-transformation GAN","date":"2021-04-11","arxiv_id":"2105.00930","repositories_listed":1,"syntology":null},{"url":"/paper/pseudo-supervised-deep-subspace-clustering","slug":"pseudo-supervised-deep-subspace-clustering","title":"Pseudo-supervised Deep Subspace Clustering","date":"2021-04-08","arxiv_id":"2104.03531","repositories_listed":1,"syntology":null},{"url":"/paper/latent-space-regularization-for-unsupervised","slug":"latent-space-regularization-for-unsupervised","title":"Latent Space Regularization for Unsupervised Domain Adaptation in Semantic Segmentation","date":"2021-04-06","arxiv_id":"2104.02633","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-self-discrepancy-via-multiple","slug":"learning-from-self-discrepancy-via-multiple","title":"Learning from Self-Discrepancy via Multiple Co-teaching for Cross-Domain Person Re-Identification","date":"2021-04-06","arxiv_id":"2104.02265","repositories_listed":1,"syntology":null},{"url":"/paper/learning-spatial-context-with-graph-neural","slug":"learning-spatial-context-with-graph-neural","title":"Learning Spatial Context with Graph Neural Network for Multi-Person Pose Grouping","date":"2021-04-06","arxiv_id":"2104.02385","repositories_listed":1,"syntology":null},{"url":"/paper/speaker-diarization-using-two-pass-leave-one","slug":"speaker-diarization-using-two-pass-leave-one","title":"Speaker Diarization using Two-pass Leave-One-Out Gaussian PLDA Clustering of DNN Embeddings","date":"2021-04-06","arxiv_id":"2104.02469","repositories_listed":1,"syntology":null},{"url":"/paper/segmentation-of-em-showers-for-neutrino","slug":"segmentation-of-em-showers-for-neutrino","title":"Segmentation of EM showers for neutrino experiments with deep graph neural networks","date":"2021-04-05","arxiv_id":"2104.02040","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-clustering-with-inaccurate","slug":"semi-supervised-clustering-with-inaccurate","title":"Semi-Supervised Clustering with Inaccurate Pairwise Annotations","date":"2021-04-05","arxiv_id":"2104.02146","repositories_listed":1,"syntology":null},{"url":"/paper/simcd-simultaneous-clustering-and","slug":"simcd-simultaneous-clustering-and","title":"SimCD: Simultaneous Clustering and Differential expression analysis for single-cell transcriptomic data","date":"2021-04-04","arxiv_id":"2104.01512","repositories_listed":1,"syntology":null},{"url":"/paper/graph-contrastive-clustering","slug":"graph-contrastive-clustering","title":"Graph Contrastive Clustering","date":"2021-04-03","arxiv_id":"2104.01429","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":1,"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/graph-contrastive-clustering#ran","syntology_url":"https://syntology.ai/paper/2104.01429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01429"}},"official":null}},{"url":"/paper/instance-level-affinity-based-transfer-for","slug":"instance-level-affinity-based-transfer-for","title":"Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation","date":"2021-04-03","arxiv_id":"2104.01286","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/instance-level-affinity-based-transfer-for#ran","syntology_url":"https://syntology.ai/paper/2104.01286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01286"}},"official":{"repos":["astuti/ILA-DA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/fast-parallel-algorithms-for-euclidean","slug":"fast-parallel-algorithms-for-euclidean","title":"Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering","date":"2021-04-02","arxiv_id":"2104.01126","repositories_listed":1,"syntology":null},{"url":"/paper/streaming-social-event-detection-and","slug":"streaming-social-event-detection-and","title":"Streaming Social Event Detection and Evolution Discovery in Heterogeneous Information Networks","date":"2021-04-02","arxiv_id":"2104.00853","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-acoustic-unit-discovery-by","slug":"unsupervised-acoustic-unit-discovery-by","title":"Unsupervised Acoustic Unit Discovery by Leveraging a Language-Independent Subword Discriminative Feature Representation","date":"2021-04-02","arxiv_id":"2104.00994","repositories_listed":1,"syntology":null},{"url":"/paper/choice-aware-user-engagement-modeling","slug":"choice-aware-user-engagement-modeling","title":"Choice-Aware User Engagement Modeling andOptimization on Social Media","date":"2021-04-01","arxiv_id":"2104.00801","repositories_listed":1,"syntology":null},{"url":"/paper/jigsaw-clustering-for-unsupervised-visual","slug":"jigsaw-clustering-for-unsupervised-visual","title":"Jigsaw Clustering for Unsupervised Visual Representation Learning","date":"2021-04-01","arxiv_id":"2104.00323","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-a-joint-of-phenotypic-and-genetic","slug":"leveraging-a-joint-of-phenotypic-and-genetic","title":"Leveraging a Joint of Phenotypic and Genetic Features on Cancer Patient Subgrouping","date":"2021-03-30","arxiv_id":"2103.16316","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-clustering-of-partial-records","slug":"model-based-clustering-of-partial-records","title":"Fast model-based clustering of partial records","date":"2021-03-30","arxiv_id":"2103.16336","repositories_listed":1,"syntology":null},{"url":"/paper/changing-the-mind-of-transformers-for","slug":"changing-the-mind-of-transformers-for","title":"Changing the Mind of Transformers for Topically-Controllable Language Generation","date":"2021-03-29","arxiv_id":"2103.15335","repositories_listed":1,"syntology":null},{"url":"/paper/multiscale-clustering-of-hyperspectral-images","slug":"multiscale-clustering-of-hyperspectral-images","title":"Multiscale Clustering of Hyperspectral Images Through Spectral-Spatial Diffusion Geometry","date":"2021-03-29","arxiv_id":"2103.15783","repositories_listed":1,"syntology":null},{"url":"/paper/no-frame-left-behind-full-video-action","slug":"no-frame-left-behind-full-video-action","title":"No frame left behind: Full Video Action Recognition","date":"2021-03-29","arxiv_id":"2103.15395","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-discriminative-feature","slug":"self-supervised-discriminative-feature","title":"Self-supervised Discriminative Feature Learning for Deep Multi-view Clustering","date":"2021-03-28","arxiv_id":"2103.15069","repositories_listed":1,"syntology":null},{"url":"/paper/geosp-a-parallel-method-for-a-cortical","slug":"geosp-a-parallel-method-for-a-cortical","title":"GeoSP: A parallel method for a cortical surface parcellation based on geodesic distance","date":"2021-03-26","arxiv_id":"2103.14579","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-x-clustering-in-the-consensus","slug":"progressive-x-clustering-in-the-consensus","title":"Finding Geometric Models by Clustering in the Consensus Space","date":"2021-03-25","arxiv_id":"2103.13875","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/progressive-x-clustering-in-the-consensus#ran","syntology_url":"https://syntology.ai/paper/2103.13875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13875"}},"official":{"repos":["danini/clustering-in-consensus-space"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-novel-adaptive-minority-oversampling","slug":"a-novel-adaptive-minority-oversampling","title":"A Novel Adaptive Minority Oversampling Technique for Improved Classification in Data Imbalanced Scenarios","date":"2021-03-24","arxiv_id":"2103.13823","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-face-clustering-on-a-large","slug":"structure-aware-face-clustering-on-a-large","title":"Structure-Aware Face Clustering on a Large-Scale Graph with $\\bf{10^{7}}$ Nodes","date":"2021-03-24","arxiv_id":"2103.13225","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structure-aware-face-clustering-on-a-large#ran","syntology_url":"https://syntology.ai/paper/2103.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13225"}},"official":{"repos":["sstzal/STAR-FC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/topic-modeling-genre-an-exploration-of-french","slug":"topic-modeling-genre-an-exploration-of-french","title":"Topic Modeling Genre: An Exploration of French Classical and Enlightenment Drama","date":"2021-03-24","arxiv_id":"2103.13019","repositories_listed":1,"syntology":null},{"url":"/paper/vlgrammar-grounded-grammar-induction-of","slug":"vlgrammar-grounded-grammar-induction-of","title":"VLGrammar: Grounded Grammar Induction of Vision and Language","date":"2021-03-24","arxiv_id":"2103.12975","repositories_listed":1,"syntology":null},{"url":"/paper/group-aware-label-transfer-for-domain","slug":"group-aware-label-transfer-for-domain","title":"Group-aware Label Transfer for Domain Adaptive Person Re-identification","date":"2021-03-23","arxiv_id":"2103.12366","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/group-aware-label-transfer-for-domain#ran","syntology_url":"https://syntology.ai/paper/2103.12366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12366"}},"official":{"repos":["zkcys001/UDAStrongBaseline"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ast2vec-utilizing-recursive-neural-encodings","slug":"ast2vec-utilizing-recursive-neural-encodings","title":"ast2vec: Utilizing Recursive Neural Encodings of Python Programs","date":"2021-03-22","arxiv_id":"2103.11614","repositories_listed":1,"syntology":null},{"url":"/paper/forest-fire-clustering-cluster-oriented-label","slug":"forest-fire-clustering-cluster-oriented-label","title":"Forest Fire Clustering for Single-cell Sequencing with Iterative Label Propagation and Parallelized Monte Carlo Simulation","date":"2021-03-22","arxiv_id":"2103.11802","repositories_listed":1,"syntology":null},{"url":"/paper/laneaf-robust-multi-lane-detection-with","slug":"laneaf-robust-multi-lane-detection-with","title":"LaneAF: Robust Multi-Lane Detection with Affinity Fields","date":"2021-03-22","arxiv_id":"2103.12040","repositories_listed":1,"syntology":null},{"url":"/paper/deepened-graph-auto-encoders-help-stabilize","slug":"deepened-graph-auto-encoders-help-stabilize","title":"Deepened Graph Auto-Encoders Help Stabilize and Enhance Link Prediction","date":"2021-03-21","arxiv_id":"2103.11414","repositories_listed":1,"syntology":null},{"url":"/paper/scanmix-learning-from-severe-label-noise-via","slug":"scanmix-learning-from-severe-label-noise-via","title":"ScanMix: Learning from Severe Label Noise via Semantic Clustering and Semi-Supervised Learning","date":"2021-03-21","arxiv_id":"2103.11395","repositories_listed":1,"syntology":null},{"url":"/paper/temporally-weighted-hierarchical-clustering","slug":"temporally-weighted-hierarchical-clustering","title":"Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentation","date":"2021-03-20","arxiv_id":"2103.11264","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/temporally-weighted-hierarchical-clustering#ran","syntology_url":"https://syntology.ai/paper/2103.11264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11264"}},"official":{"repos":["ssarfraz/FINCH-CLustering"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-the-superpixel-in-a-non-iterative","slug":"learning-the-superpixel-in-a-non-iterative","title":"Learning the Superpixel in a Non-iterative and Lifelong Manner","date":"2021-03-19","arxiv_id":"2103.10681","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/learning-the-superpixel-in-a-non-iterative#ran","syntology_url":"https://syntology.ai/paper/2103.10681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10681"}},"official":{"repos":["zh460045050/LNSNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/outcome-guided-sparse-k-means-for-disease","slug":"outcome-guided-sparse-k-means-for-disease","title":"Outcome-guided Sparse K-means for Disease Subtype Discovery via Integrating Phenotypic Data with High-dimensional Transcriptomic Data","date":"2021-03-18","arxiv_id":"2103.09974","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-whitney-extension-problem-for-near","slug":"on-the-whitney-extension-problem-for-near","title":"On the Whitney near extension problem, BMO, alignment of data, best approximation in algebraic geometry, manifold learning and their beautiful connections: A modern treatment","date":"2021-03-17","arxiv_id":"2103.09748","repositories_listed":1,"syntology":null},{"url":"/paper/spice-semantic-pseudo-labeling-for-image","slug":"spice-semantic-pseudo-labeling-for-image","title":"SPICE: Semantic Pseudo-labeling for Image Clustering","date":"2021-03-17","arxiv_id":"2103.09382","repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-proposal-classifier-for-multiple","slug":"learning-a-proposal-classifier-for-multiple","title":"Learning a Proposal Classifier for Multiple Object Tracking","date":"2021-03-14","arxiv_id":"2103.07889","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-a-proposal-classifier-for-multiple#ran","syntology_url":"https://syntology.ai/paper/2103.07889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07889"}},"official":{"repos":["daip13/LPC_MOT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/three-steps-to-multimodal-trajectory","slug":"three-steps-to-multimodal-trajectory","title":"Three Steps to Multimodal Trajectory Prediction: Modality Clustering, Classification and Synthesis","date":"2021-03-14","arxiv_id":"2103.07854","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/three-steps-to-multimodal-trajectory#ran","syntology_url":"https://syntology.ai/paper/2103.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07854"}},"official":null}},{"url":"/paper/reconsidering-representation-alignment-for","slug":"reconsidering-representation-alignment-for","title":"Reconsidering Representation Alignment for Multi-view Clustering","date":"2021-03-13","arxiv_id":"2103.07738","repositories_listed":1,"syntology":null},{"url":"/paper/information-maximization-clustering-via-multi","slug":"information-maximization-clustering-via-multi","title":"Information Maximization Clustering via Multi-View Self-Labelling","date":"2021-03-12","arxiv_id":"2103.07368","repositories_listed":1,"syntology":null},{"url":"/paper/intraclass-clustering-an-implicit-learning-1","slug":"intraclass-clustering-an-implicit-learning-1","title":"Intraclass clustering: an implicit learning ability that regularizes DNNs","date":"2021-03-11","arxiv_id":"2103.06733","repositories_listed":1,"syntology":null},{"url":"/paper/doubly-contrastive-deep-clustering","slug":"doubly-contrastive-deep-clustering","title":"Doubly Contrastive Deep Clustering","date":"2021-03-09","arxiv_id":"2103.05484","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-dimensionality-reduction-results","slug":"explaining-dimensionality-reduction-results","title":"Explaining dimensionality reduction results using Shapley values","date":"2021-03-09","arxiv_id":"2103.05678","repositories_listed":1,"syntology":null},{"url":"/paper/a-topological-approach-to-compare-document","slug":"a-topological-approach-to-compare-document","title":"A Topological Approach to Compare Document Semantics Based on a New Variant of Syntactic N-grams","date":"2021-03-08","arxiv_id":"2103.05135","repositories_listed":1,"syntology":null},{"url":"/paper/joint-noise-tolerant-learning-and-meta-camera","slug":"joint-noise-tolerant-learning-and-meta-camera","title":"Joint Noise-Tolerant Learning and Meta Camera Shift Adaptation for Unsupervised Person Re-Identification","date":"2021-03-08","arxiv_id":"2103.04618","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-network-denoising-in","slug":"convolutional-neural-network-denoising-in","title":"Convolutional Neural Network Denoising in Fluorescence Lifetime Imaging Microscopy (FLIM)","date":"2021-03-07","arxiv_id":"2103.05448","repositories_listed":1,"syntology":null},{"url":"/paper/revdet-robust-and-memory-efficient-event","slug":"revdet-robust-and-memory-efficient-event","title":"RevDet: Robust and Memory Efficient Event Detection and Tracking in Large News Feeds","date":"2021-03-07","arxiv_id":"2103.04390","repositories_listed":1,"syntology":null},{"url":"/paper/novelty-detection-in-sequential-data-by","slug":"novelty-detection-in-sequential-data-by","title":"Novelty Detection in Sequential Data by Informed Clustering and Modeling","date":"2021-03-05","arxiv_id":"2103.03943","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/novelty-detection-in-sequential-data-by#ran","syntology_url":"https://syntology.ai/paper/2103.03943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03943"}},"official":{"repos":["kampmichael/noveltydetectionsequentialdata"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-gaussian-mixture-based-deep","slug":"dynamic-gaussian-mixture-based-deep","title":"Dynamic Gaussian Mixture based Deep Generative Model For Robust Forecasting on Sparse Multivariate Time Series","date":"2021-03-03","arxiv_id":"2103.02164","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-semi-supervised-learning-and-more-a","slug":"fairness-semi-supervised-learning-and-more-a","title":"Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints","date":"2021-03-02","arxiv_id":"2103.02013","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-classification-via-adaptive","slug":"multi-label-classification-via-adaptive","title":"Multi-label Classification via Adaptive Resonance Theory-based Clustering","date":"2021-03-02","arxiv_id":"2103.01511","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-symmetric-nonnegative-matrix","slug":"self-supervised-symmetric-nonnegative-matrix","title":"Self-supervised Symmetric Nonnegative Matrix Factorization","date":"2021-03-02","arxiv_id":"2103.01689","repositories_listed":1,"syntology":null},{"url":"/paper/partially-view-aligned-representation","slug":"partially-view-aligned-representation","title":"Partially View-aligned Representation Learning with Noise-robust Contrastive Loss","date":"2021-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/is-simple-uniform-sampling-efficient-for","slug":"is-simple-uniform-sampling-efficient-for","title":"Is Simple Uniform Sampling Effective for Center-Based Clustering with Outliers: When and Why?","date":"2021-02-28","arxiv_id":"2103.00558","repositories_listed":1,"syntology":null},{"url":"/paper/validating-clustering-frameworks-for-electric","slug":"validating-clustering-frameworks-for-electric","title":"Validating Clustering Frameworks for Electric Load Demand Profiles","date":"2021-02-26","arxiv_id":"2103.00030","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-measure-for-sparse-time-course","slug":"similarity-measure-for-sparse-time-course","title":"Similarity measure for sparse time course data based on Gaussian processes","date":"2021-02-24","arxiv_id":"2102.12342","repositories_listed":1,"syntology":null},{"url":"/paper/two-way-kernel-matrix-puncturing-towards","slug":"two-way-kernel-matrix-puncturing-towards","title":"Two-way kernel matrix puncturing: towards resource-efficient PCA and spectral clustering","date":"2021-02-24","arxiv_id":"2102.12293","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-semantic-discovery-through","slug":"unsupervised-semantic-discovery-through","title":"Unsupervised semantic discovery through visual patterns detection","date":"2021-02-24","arxiv_id":"2102.12213","repositories_listed":1,"syntology":null},{"url":"/paper/cac-a-clustering-based-framework-for","slug":"cac-a-clustering-based-framework-for","title":"Clustering Aware Classification for Risk Prediction and Subtyping in Clinical Data","date":"2021-02-23","arxiv_id":"2102.11872","repositories_listed":1,"syntology":null},{"url":"/paper/event-camera-based-real-time-detection-and","slug":"event-camera-based-real-time-detection-and","title":"Event Camera Based Real-Time Detection and Tracking of Indoor Ground Robots","date":"2021-02-23","arxiv_id":"2102.11916","repositories_listed":1,"syntology":null},{"url":"/paper/non-linear-sparse-dimensionality-reduction","slug":"non-linear-sparse-dimensionality-reduction","title":"Non-linear, Sparse Dimensionality Reduction via Path Lasso Penalized Autoencoders","date":"2021-02-22","arxiv_id":"2102.10873","repositories_listed":1,"syntology":null},{"url":"/paper/user-factor-adaptation-for-user-embedding-via","slug":"user-factor-adaptation-for-user-embedding-via","title":"User Factor Adaptation for User Embedding via Multitask Learning","date":"2021-02-22","arxiv_id":"2102.11103","repositories_listed":1,"syntology":null},{"url":"/paper/ntreeclus-a-tree-based-sequence-encoder-for","slug":"ntreeclus-a-tree-based-sequence-encoder-for","title":"nTreeClus: a Tree-based Sequence Encoder for Clustering Categorical Series","date":"2021-02-20","arxiv_id":"2102.10252","repositories_listed":1,"syntology":null},{"url":"/paper/co-clustering-vertices-and-hyperedges-via","slug":"co-clustering-vertices-and-hyperedges-via","title":"Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning","date":"2021-02-19","arxiv_id":"2102.10169","repositories_listed":1,"syntology":null},{"url":"/paper/local-hyper-flow-diffusion","slug":"local-hyper-flow-diffusion","title":"Local Hyper-Flow Diffusion","date":"2021-02-16","arxiv_id":"2102.07945","repositories_listed":1,"syntology":null},{"url":"/paper/online-deterministic-annealing-for","slug":"online-deterministic-annealing-for","title":"Online Deterministic Annealing for Classification and Clustering","date":"2021-02-11","arxiv_id":"2102.05836","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-ground-metric-learning-using","slug":"unsupervised-ground-metric-learning-using","title":"Unsupervised Ground Metric Learning using Wasserstein Singular Vectors","date":"2021-02-11","arxiv_id":"2102.06278","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-b-vaes-for-quantifying-biodiversity","slug":"dynamic-b-vaes-for-quantifying-biodiversity","title":"Dynamic $β$-VAEs for quantifying biodiversity by clustering optically recorded insect signals","date":"2021-02-10","arxiv_id":"2102.05526","repositories_listed":1,"syntology":null},{"url":"/paper/on-pytorch-implementation-of-density","slug":"on-pytorch-implementation-of-density","title":"On PyTorch Implementation of Density Estimators for von Mises-Fisher and Its Mixture","date":"2021-02-10","arxiv_id":"2102.05340","repositories_listed":1,"syntology":null},{"url":"/paper/clustered-hierarchical-anomaly-and-outlier","slug":"clustered-hierarchical-anomaly-and-outlier","title":"Clustered Hierarchical Anomaly and Outlier Detection Algorithms","date":"2021-02-09","arxiv_id":"2103.11774","repositories_listed":1,"syntology":null},{"url":"/paper/eigengame-unloaded-when-playing-games-is","slug":"eigengame-unloaded-when-playing-games-is","title":"EigenGame Unloaded: When playing games is better than optimizing","date":"2021-02-08","arxiv_id":"2102.04152","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/eigengame-unloaded-when-playing-games-is#ran","syntology_url":"https://syntology.ai/paper/2102.04152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04152"}},"official":null}},{"url":"/paper/meta-discovery-learning-to-discover-novel","slug":"meta-discovery-learning-to-discover-novel","title":"Meta Discovery: Learning to Discover Novel Classes given Very Limited Data","date":"2021-02-08","arxiv_id":"2102.04002","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-to-dilute-outliers-for","slug":"graph-neural-network-to-dilute-outliers-for","title":"Graph Neural Network to Dilute Outliers for Refactoring Monolith Application","date":"2021-02-07","arxiv_id":"2102.03827","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/graph-neural-network-to-dilute-outliers-for#ran","syntology_url":"https://syntology.ai/paper/2102.03827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03827"}},"official":{"repos":["utkd/cogcn"],"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/refining-a-nearest-neighbor-graph-for-a","slug":"refining-a-nearest-neighbor-graph-for-a","title":"Refining a -nearest neighbor graph for a computationally efficient spectral clustering","date":"2021-02-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-simpler-spectral-approach-for-clustering-in","slug":"a-simpler-spectral-approach-for-clustering-in","title":"A simpler spectral approach for clustering in directed networks","date":"2021-02-05","arxiv_id":"2102.03188","repositories_listed":1,"syntology":null},{"url":"/paper/estimation-of-microphone-clusters-in-acoustic","slug":"estimation-of-microphone-clusters-in-acoustic","title":"Estimation of Microphone Clusters in Acoustic Sensor Networks using Unsupervised Federated Learning","date":"2021-02-05","arxiv_id":"2102.03109","repositories_listed":1,"syntology":null},{"url":"/paper/vine-copula-mixture-models-and-clustering-for","slug":"vine-copula-mixture-models-and-clustering-for","title":"Vine copula mixture models and clustering for non-Gaussian data","date":"2021-02-05","arxiv_id":"2102.03257","repositories_listed":1,"syntology":null},{"url":"/paper/fedzip-a-compression-framework-for","slug":"fedzip-a-compression-framework-for","title":"FEDZIP: A Compression Framework for Communication-Efficient Federated Learning","date":"2021-02-02","arxiv_id":"2102.01593","repositories_listed":1,"syntology":null},{"url":"/paper/super-klust-another-way-of-piecewise-linear","slug":"super-klust-another-way-of-piecewise-linear","title":"Super-klust: Another Way of Piecewise Linear Classification","date":"2021-02-02","arxiv_id":"2102.01571","repositories_listed":1,"syntology":null},{"url":"/paper/a-multiscale-environment-for-learning-by","slug":"a-multiscale-environment-for-learning-by","title":"A Multiscale Environment for Learning by Diffusion","date":"2021-01-31","arxiv_id":"2102.00500","repositories_listed":1,"syntology":null},{"url":"/paper/re-deep-fair-clustering-for-visual-learning","slug":"re-deep-fair-clustering-for-visual-learning","title":"[Re] Deep Fair Clustering for Visual Learning","date":"2021-01-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/re-explaining-groups-of-points-in-low-1","slug":"re-explaining-groups-of-points-in-low-1","title":"[Re] Explaining Groups of Points in Low-Dimensional Representations","date":"2021-01-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-activity-recognition-via","slug":"cross-domain-activity-recognition-via","title":"Cross-domain Activity Recognition via Substructural Optimal Transport","date":"2021-01-29","arxiv_id":"2102.03353","repositories_listed":1,"syntology":null},{"url":"/paper/fdapy-a-python-package-for-functional-data","slug":"fdapy-a-python-package-for-functional-data","title":"FDApy: a Python package for functional data","date":"2021-01-26","arxiv_id":"2101.11003","repositories_listed":1,"syntology":null},{"url":"/paper/multiface-a-generic-training-mechanism-for","slug":"multiface-a-generic-training-mechanism-for","title":"MultiFace: A Generic Training Mechanism for Boosting Face Recognition Performance","date":"2021-01-25","arxiv_id":"2101.09899","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-key-phrase-extraction-and","slug":"unsupervised-key-phrase-extraction-and","title":"Unsupervised Key-phrase Extraction and Clustering for Classification Scheme in Scientific Publications","date":"2021-01-25","arxiv_id":"2101.09990","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-sequence-clustering-for-human","slug":"disentangled-sequence-clustering-for-human","title":"Disentangled Sequence Clustering for Human Intention Inference","date":"2021-01-23","arxiv_id":"2101.09500","repositories_listed":1,"syntology":null},{"url":"/paper/gpu-accelerated-optimizer-aware-evaluation-of","slug":"gpu-accelerated-optimizer-aware-evaluation-of","title":"GPU-Accelerated Optimizer-Aware Evaluation of Submodular Exemplar Clustering","date":"2021-01-21","arxiv_id":"2101.08763","repositories_listed":1,"syntology":null},{"url":"/paper/caegcn-cross-attention-fusion-based-enhanced","slug":"caegcn-cross-attention-fusion-based-enhanced","title":"CaEGCN: Cross-Attention Fusion based Enhanced Graph Convolutional Network for Clustering","date":"2021-01-18","arxiv_id":"2101.06883","repositories_listed":1,"syntology":null},{"url":"/paper/acp-automatic-channel-pruning-via-clustering","slug":"acp-automatic-channel-pruning-via-clustering","title":"ACP: Automatic Channel Pruning via Clustering and Swarm Intelligence Optimization for CNN","date":"2021-01-16","arxiv_id":"2101.06407","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-clustering-of-disorder-events-during","slug":"temporal-clustering-of-disorder-events-during","title":"Temporal Clustering of Disorder Events During the COVID-19 Pandemic","date":"2021-01-16","arxiv_id":"2101.06458","repositories_listed":1,"syntology":null},{"url":"/paper/tc-dtw-accelerating-multivariate-dynamic-time","slug":"tc-dtw-accelerating-multivariate-dynamic-time","title":"TC-DTW: Accelerating Multivariate Dynamic Time Warping Through Triangle Inequality and Point Clustering","date":"2021-01-15","arxiv_id":"2101.07731","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-word-embeddings-with-self","slug":"clustering-word-embeddings-with-self","title":"Clustering Word Embeddings with Self-Organizing Maps. Application on LaRoSeDa -- A Large Romanian Sentiment Data Set","date":"2021-01-11","arxiv_id":"2101.04197","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-deep-constrained-clustering","slug":"a-framework-for-deep-constrained-clustering","title":"A Framework for Deep Constrained Clustering","date":"2021-01-07","arxiv_id":"2101.02792","repositories_listed":1,"syntology":null},{"url":"/paper/application-of-knowledge-graphs-to-provide","slug":"application-of-knowledge-graphs-to-provide","title":"Application of Knowledge Graphs to Provide Side Information for Improved Recommendation Accuracy","date":"2021-01-07","arxiv_id":"2101.03054","repositories_listed":1,"syntology":null}],"record_sha256":"c4ebb2d8eb53feee975d2f301a9fa5c764c68f45bf55f65e9b07ad5bfaa0bb29","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}