{"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/graph-clustering/papers/4","list_of":"/task/graph-clustering","task":"Graph 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":4,"pages_in_order":4,"rows_per_page":100,"rows":[301,393],"of":393,"counts":{"archive_papers_tagged":393,"with_a_code_link":180,"where_syntology_ran_a_sample":33,"not_listed_spam_title":0,"listed":393,"listed_where_code_ran":33,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":31,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":31,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/graph-clustering","prev":"/task/graph-clustering/papers/3","next":null,"papers":[{"url":null,"slug":"scaling-graph-clustering-with-distributed","title":"Scaling Graph Clustering with Distributed Sketches","date":"2020-07-24","arxiv_id":"2007.12669","repositories_listed":0,"syntology":null},{"url":"/paper/differentiable-hierarchical-graph-grouping","slug":"differentiable-hierarchical-graph-grouping","title":"Differentiable Hierarchical Graph Grouping for Multi-Person Pose Estimation","date":"2020-07-23","arxiv_id":"2007.11864","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-with-graph-neural-networks","title":"Graph Clustering with Graph Neural Networks","date":"2020-06-30","arxiv_id":"2006.16904","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-video-representation-learning-via","title":"Large Scale Video Representation Learning via Relational Graph Clustering","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pagerank-and-the-k-means-clustering-algorithm","title":"PageRank and The K-Means Clustering Algorithm","date":"2020-05-10","arxiv_id":"2005.04774","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-model-for-image-segmentation-in-retina","title":"A Model for Image Segmentation in Retina","date":"2020-05-06","arxiv_id":"2005.02567","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-for-graph-datasets-via-gumbel","title":"Community Detection Clustering via Gumbel Softmax","date":"2020-05-05","arxiv_id":"2005.02372","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-graph-clustering-with-network-lasso","title":"Local Graph Clustering with Network Lasso","date":"2020-04-25","arxiv_id":"2004.12199","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-graph-auto-encoder-with-joint","title":"Embedding Graph Auto-Encoder for Graph Clustering","date":"2020-02-20","arxiv_id":"2002.08643","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-group-norm-regularized-lrr-factorization","title":"A Group Norm Regularized Factorization Model for Subspace Segmentation","date":"2020-01-08","arxiv_id":"2001.02568","repositories_listed":0,"syntology":null},{"url":null,"slug":"independence-promoted-graph-disentangled","title":"Independence Promoted Graph Disentangled Networks","date":"2019-11-26","arxiv_id":"1911.11430","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-joint-variational-graph-autoencoders","title":"Dynamic Joint Variational Graph Autoencoders","date":"2019-10-04","arxiv_id":"1910.01963","repositories_listed":0,"syntology":null},{"url":null,"slug":"layout-graph-reasoning-for-fashion-landmark-1","title":"Layout-Graph Reasoning for Fashion Landmark Detection","date":"2019-10-04","arxiv_id":"1910.01923","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-alzheimers-disease-by-hierarchical","title":"Predicting Alzheimer's Disease by Hierarchical Graph Convolution from Positron Emission Tomography Imaging","date":"2019-10-01","arxiv_id":"1910.00185","repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-structure-aware-spectral-clustering","title":"Subspace Structure-Aware Spectral Clustering for Robust Subspace Clustering","date":"2019-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hermitian-matrices-for-clustering-directed","title":"Hermitian matrices for clustering directed graphs: insights and applications","date":"2019-08-06","arxiv_id":"1908.02096","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-guarantees-for-local-graph","title":"Statistical guarantees for local graph clustering","date":"2019-06-11","arxiv_id":"1906.04863","repositories_listed":0,"syntology":null},{"url":null,"slug":"l2finesc-id-at-semeval-2019-task-2","title":"L2F/INESC-ID at SemEval-2019 Task 2: Unsupervised Lexical Semantic Frame Induction using Contextualized Word Representations","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-aware-graph-construction-a-joint","title":"Clustering-aware Graph Construction: A Joint Learning Perspective","date":"2019-05-04","arxiv_id":"1905.01446","repositories_listed":0,"syntology":null},{"url":null,"slug":"neighbor-similarity-based-agglomerative","title":"Neighbor Similarity Based Agglomerative Method for Community Detection in Networks","date":"2019-05-02","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-geometrical-graph-classification","title":"DEEP GEOMETRICAL GRAPH CLASSIFICATION","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"190412986","title":"Community Detection and Growth Potential Prediction Using the Stochastic Block Model and the Long Short-term Memory from Patent Citation Networks","date":"2019-04-23","arxiv_id":"1904.12986","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-review-of-stochastic-block-models-and","title":"A Review of Stochastic Block Models and Extensions for Graph Clustering","date":"2019-03-01","arxiv_id":"1903.00114","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-nonlinear-eigenfunctions-via","title":"Computing Nonlinear Eigenfunctions via Gradient Flow Extinction","date":"2019-02-27","arxiv_id":"1902.10414","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-embedding-with-adversarial","title":"Learning Graph Embedding with Adversarial Training Methods","date":"2019-01-04","arxiv_id":"1901.01250","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-gradient-descent-for-spectral","title":"Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint","date":"2018-12-13","arxiv_id":"1812.05721","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilayer-graph-signal-clustering","title":"OrthoNet: Multilayer Network Data Clustering","date":"2018-11-02","arxiv_id":"1811.00821","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-of-graph-vertex-subset-via-krylov","title":"Distance preserving model order reduction of graph-Laplacians and cluster analysis","date":"2018-09-09","arxiv_id":"1809.03048","repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-multi-graph-matching-via","title":"Incremental Multi-graph Matching via Diversity and Randomness based Graph Clustering","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-a-two-truths-phenomenon-in-spectral-graph","title":"On a 'Two Truths' Phenomenon in Spectral Graph Clustering","date":"2018-08-23","arxiv_id":"1808.07801","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":"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":"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":"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":"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":"coreclust-a-new-package-for-a-robust-and","title":"COREclust: a new package for a robust and scalable analysis of complex data","date":"2018-05-25","arxiv_id":"1805.10211","repositories_listed":0,"syntology":null},{"url":null,"slug":"searching-for-a-single-community-in-a-graph","title":"Searching for a Single Community in a Graph","date":"2018-05-24","arxiv_id":"1806.07944","repositories_listed":0,"syntology":null},{"url":null,"slug":"tie-line-characteristics-based-partitioning","title":"Tie-Line Characteristics based Partitioning for Distributed Optimization of Power Systems","date":"2018-05-24","arxiv_id":"1805.09779","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-algorithms-for-the","title":"Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs","date":"2018-05-02","arxiv_id":"1805.00862","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theoretical-investigation-of-graph-degree","title":"A Theoretical Investigation of Graph Degree as an Unsupervised Normality Measure","date":"2018-01-24","arxiv_id":"1801.07889","repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-clustering-via-tangent-cones","title":"Subspace Clustering via Tangent Cones","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"marginalized-graph-autoencoder-for-graph","title":"Marginalized graph autoencoder for graph clustering","date":"2017-11-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-spectral-graph-clustering-with","title":"Revisiting Spectral Graph Clustering with Generative Community Models","date":"2017-09-14","arxiv_id":"1709.04594","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-attacks-against-graph-based","title":"Practical Attacks Against Graph-based Clustering","date":"2017-08-29","arxiv_id":"1708.09056","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-clustering-via-non-backtracking-random","title":"Faster Clustering via Non-Backtracking Random Walks","date":"2017-08-26","arxiv_id":"1708.07967","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilayer-spectral-graph-clustering-via-1","title":"Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms","date":"2017-08-08","arxiv_id":"1708.02620","repositories_listed":0,"syntology":null},{"url":null,"slug":"capacity-releasing-diffusion-for-speed-and","title":"Capacity Releasing Diffusion for Speed and Locality.","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-word-clusters-using-signed-spectral","title":"Semantic Word Clusters Using Signed Spectral Clustering","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"capacity-releasing-diffusion-for-speed-and-1","title":"Capacity Releasing Diffusion for Speed and Locality","date":"2017-06-19","arxiv_id":"1706.05826","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-clustering-based-on-content-and","title":"Hybrid Clustering based on Content and Connection Structure using Joint Nonnegative Matrix Factorization","date":"2017-03-28","arxiv_id":"1703.09646","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-block-models-and-model-free","title":"Graph Clustering: Block-models and model free results","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multilayer-spectral-graph-clustering-via","title":"Multilayer Spectral Graph Clustering via Convex Layer Aggregation","date":"2016-09-23","arxiv_id":"1609.07200","repositories_listed":0,"syntology":null},{"url":null,"slug":"gowvis-a-web-application-for-graph-of-words","title":"GoWvis: A Web Application for Graph-of-Words-based Text Visualization and Summarization","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-graph-clustering-by-load","title":"Distributed Graph Clustering by Load Balancing","date":"2016-07-18","arxiv_id":"1607.04984","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphons-mergeons-and-so-on","title":"Graphons, mergeons, and so on!","date":"2016-07-06","arxiv_id":"1607.01718","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-recovery-in-shuffled-graphs-via","title":"Information Recovery in Shuffled Graphs via Graph Matching","date":"2016-05-08","arxiv_id":"1605.02315","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-logarithmic-proximity-measures-outperform","title":"Do logarithmic proximity measures outperform plain ones in graph clustering?","date":"2016-05-03","arxiv_id":"1605.01046","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-bandits-for-recommendation","title":"Graph Clustering Bandits for Recommendation","date":"2016-05-02","arxiv_id":"1605.00596","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-variational-image","title":"Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images","date":"2016-02-27","arxiv_id":"1602.08574","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-networks-for-learning-graph","title":"Deep neural networks for learning graph representations","date":"2016-02-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multicuts-and-perturb-map-for-probabilistic","title":"Multicuts and Perturb & MAP for Probabilistic Graph Clustering","date":"2016-01-09","arxiv_id":"1601.02088","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-comparison-of-the-summarization","title":"An Empirical Comparison of the Summarization Power of Graph Clustering Methods","date":"2015-11-21","arxiv_id":"1511.06820","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-low-rank-estimation-by-projected","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","date":"2015-09-10","arxiv_id":"1509.03025","repositories_listed":0,"syntology":null},{"url":null,"slug":"integration-of-graph-clustering-with-ant","title":"Integration of graph clustering with ant colony optimization for feature selection","date":"2015-09-04","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lost-in-discussion-tracking-opinion-groups-in","title":"Lost in Discussion? Tracking Opinion Groups in Complex Political Discussions by the Example of the FOMC Meeting Transcriptions","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"opinion-holder-and-target-extraction-based-on","title":"Opinion Holder and Target Extraction based on the Induction of Verbal Categories","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphs-in-machine-learning-an-introduction","title":"Graphs in machine learning: an introduction","date":"2015-06-23","arxiv_id":"1506.06962","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometry-aware-neighborhood-search-for","title":"Geometry-Aware Neighborhood Search for Learning Local Models for Image Reconstruction","date":"2015-05-06","arxiv_id":"1505.01429","repositories_listed":0,"syntology":null},{"url":null,"slug":"median-evidential-c-means-algorithm-and-its","title":"Median evidential c-means algorithm and its application to community detection","date":"2015-01-07","arxiv_id":"1501.01460","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-from-labels-and-time-varying","title":"Clustering from Labels and Time-Varying Graphs","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-with-missing-data-convex","title":"Graph Clustering With Missing Data: Convex Algorithms and Analysis","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-application-of-topological-graph","title":"An application of topological graph clustering to protein function prediction","date":"2014-08-24","arxiv_id":"1408.5634","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-genetic-algorithm-for-software-design","title":"A Genetic Algorithm for Software Design Migration from Structured to Object Oriented Paradigm","date":"2014-07-23","arxiv_id":"1407.6116","repositories_listed":0,"syntology":null},{"url":null,"slug":"resolution-limit-free-and-local-non-negative","title":"Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering","date":"2014-07-22","arxiv_id":"1407.5924","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-distributional-similarities-of","title":"Distributed Distributional Similarities of Google Books Over the Centuries","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tripartite-graph-clustering-for-dynamic","title":"Tripartite Graph Clustering for Dynamic Sentiment Analysis on Social Media","date":"2014-02-24","arxiv_id":"1402.6010","repositories_listed":0,"syntology":null},{"url":null,"slug":"notes-on-elementary-spectral-graph-theory","title":"Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts","date":"2013-11-11","arxiv_id":"1311.2492","repositories_listed":0,"syntology":null},{"url":null,"slug":"jobimtext-visualizer-a-graph-based-approach","title":"JoBimText Visualizer: A Graph-based Approach to Contextualizing Distributional Similarity","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-of-a-morphous","title":"Unsupervised Learning of A-Morphous Inflection with Graph Clustering","date":"2013-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"axioms-for-graph-clustering-quality-functions","title":"Axioms for graph clustering quality functions","date":"2013-08-15","arxiv_id":"1308.3383","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-and-robust-co-regularized-multi","title":"Flexible and Robust Co-Regularized Multi-Domain Graph Clustering.","date":"2013-08-11","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-and-community-detection-in","title":"Clustering and Community Detection in Directed Networks: A Survey","date":"2013-08-05","arxiv_id":"1308.0971","repositories_listed":0,"syntology":null},{"url":null,"slug":"multigraph-clustering-for-unsupervised","title":"Multigraph Clustering for Unsupervised Coreference Resolution","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"flow-based-algorithms-for-local-graph","title":"Flow-Based Algorithms for Local Graph Clustering","date":"2013-07-10","arxiv_id":"1307.2855","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-ku-using-substitute-vectors-and-co","title":"AI-KU: Using Substitute Vectors and Co-Occurrence Modeling For Word Sense Induction and Disambiguation","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ukp-wsi-ukp-lab-semeval-2013-task-11-system","title":"UKP-WSI: UKP Lab Semeval-2013 Task 11 System Description","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"local-graph-clustering-beyond-cheegers","title":"Local Graph Clustering Beyond Cheeger's Inequality","date":"2013-04-30","arxiv_id":"1304.8132","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-eigen-updating-for-spectral-graph","title":"Efficient Eigen-updating for Spectral Graph Clustering","date":"2013-01-07","arxiv_id":"1301.1318","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-graph-clustering","title":"Improved Graph Clustering","date":"2012-10-11","arxiv_id":"1210.3335","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-parametric-estimation-method-for-graph","title":"A New Parametric Estimation Method for Graph-based Clustering","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sentence-clustering-via-projection-over-term","title":"Sentence Clustering via Projection over Term Clusters","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"co-clustering-for-directed-graphs-the","title":"Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim","date":"2012-04-10","arxiv_id":"1204.2296","repositories_listed":0,"syntology":null},{"url":null,"slug":"book-review-graph-based-natural-language","title":"Book Review: Graph-Based Natural Language Processing and Information Retrieval by Rada Mihalcea and Dragomir Radev","date":"2012-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"1c385adb144788327b5797a935041556140de2302d2e8dce6fda31af483244d8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}