{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1362825893275329664.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1145/502512.502550"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/10.1145/502512.502550"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/pdf/10.1145/502512.502550"}}],"dc:title":[{"@value":"Co-clustering documents and words using bipartite spectral graph partitioning"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1382825893275329664","@type":"Researcher","foaf:name":[{"@value":"Inderjit S. Dhillon"}],"jpcoar:affiliationName":[{"@value":"University of Texas, Austin, TX"}]}],"publication":{"prism:publicationName":[{"@value":"Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining"}],"dc:publisher":[{"@value":"ACM"}],"prism:publicationDate":"2001-08-26","prism:startingPage":"269","prism:endingPage":"274"},"reviewed":"false","dc:rights":["https://www.acm.org/publications/policies/copyright_policy#Background"],"url":[{"@id":"https://dl.acm.org/doi/10.1145/502512.502550"},{"@id":"https://dl.acm.org/doi/pdf/10.1145/502512.502550"}],"createdAt":"2004-02-03","modifiedAt":"2025-06-18","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360004231295568768","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A feature-free and parameter-light multi-task clustering framework"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004232458799360","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A Greedy Algorithm for k-Member Co-clustering and its Applicability to Collaborative Filtering"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142465873536","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Consistency-aware and Inconsistency-aware Graph-based Multi-view Clustering"}]},{"@id":"https://cir.nii.ac.jp/crid/1360017280671358208","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Improving matrix-vector multiplication via lossless grammar-compressed matrices"}]},{"@id":"https://cir.nii.ac.jp/crid/1360285705862034944","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Kansei Knowledge Extraction as Measure of Structural Heterogeneity"}]},{"@id":"https://cir.nii.ac.jp/crid/1360285706386022400","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Robust visual object clustering and its application to sightseeing spot assessment"}]},{"@id":"https://cir.nii.ac.jp/crid/1360294643747577984","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Graph-based open-ended survey on concerns related to COVID-19"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567185165094144","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A family of algorithms using spectral clustering and DBSCAN"}]},{"@id":"https://cir.nii.ac.jp/crid/1360572092786091264","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Goodness-of-fit test for latent block models"}]},{"@id":"https://cir.nii.ac.jp/crid/1360846643025921920","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Minimally Supervised Novel Relation Extraction Using a Latent Relational Mapping"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848655529446272","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848657352604416","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Submodular fractional programming for balanced clustering"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848657388935552","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Dual Exclusive Partition in Fuzzy CoDoK and SCAD-based Fuzzy Co-clustering"}]},{"@id":"https://cir.nii.ac.jp/crid/1361131415904039936","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"LP-based pivoting algorithm for higher-order correlation clustering"}]},{"@id":"https://cir.nii.ac.jp/crid/1362823123414135552","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A new method for mining of WWW access sequences"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204379164544","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Co-clustering with Recursive Elimination for Verb Synonym Extraction from Large Text Corpus"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001205107045120","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Analysis and Visualization of Internet QA Bulletin Boards Represented as Heterogeneous Networks"},{"@language":"ja","@value":"異種頂点ネットワークで表現されたインターネットＱＡ掲示板の分析と視覚化"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282763085408896","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Computational Comparison of Major Proposed Methods for Graph Partitioning Problem"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1145/502512.502550"},{"@type":"CROSSREF","@value":"10.1007/s10115-012-0550-5_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1527/tjsai.23.293_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1016/j.procs.2013.09.126_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.20965/jaciii.2019.p0005_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.23919/eusipco47968.2020.9287516_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.14778/3547305.3547321_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1007/978-981-13-3149-7_11_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1007/s11042-018-7066-2_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1587/transinf.e92.d.2334_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1371/journal.pone.0256212_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1109/grc.2014.6982834_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1109/tkde.2011.250_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1016/j.csda.2020.107090_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1002/ecjb.20394_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1007/978-3-319-94776-1_5_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1007/s10878-018-0354-y_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1016/j.patrec.2010.08.008_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"},{"@type":"CROSSREF","@value":"10.1016/j.procs.2013.09.162_references_DOI_FNNfIUbKExo69msmUXz0C2ZwwOz"}]}