{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:14:25Z","timestamp":1761610465111,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4533,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s1571-0661(05)80060-x","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"323-346","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Clusters, Concepts, and Pseudometrics"],"prefix":"10.1016","volume":"40","author":[{"given":"Michael D.","family":"Rice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Siff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1973","series-title":"\u201cCluster Analysis for Applications,\u201d Volume 19, Probability and Mathematical Statistics","author":"Anderberg","key":"10.1016\/S1571-0661(05)80060-X_BIB1"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB2","first-page":"407","article-title":"Agglomerative clustering of a search engine query log","author":"Beeferman","year":"2000","journal-title":"Proc. KDD-2000, Boston, MA"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB3","first-page":"378","article-title":"Constructing conceptual scales in formal concept analysis","author":"Cole","year":"1998","journal-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining"},{"year":"1990","series-title":"\u201cIntroduction to Lattices and Order,\u201d","author":"Davey","key":"10.1016\/S1571-0661(05)80060-X_BIB4"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB5","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/302405.302629","article-title":"Identifying objects using cluster and concept analysis","author":"van Deursen","year":"1999","journal-title":"Proceedings 21st International Conference on Software Engineering (ICSE'99), ACM"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB6","series-title":"ACM Symposium on Discrete Algorithms","article-title":"Clustering in large graphs and matrices","author":"Drineas","year":"1999"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB7","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1093\/comjnl\/41.8.578","article-title":"How many clusters? Which clustering method? Answers via model-based cluster analysis","volume":"41","author":"Fraley","year":"1998","journal-title":"Computer Journal"},{"year":"1996","series-title":"\u201cFormal Concept Analysis - Mathematical Foundations,\u201d","author":"Ganter","key":"10.1016\/S1571-0661(05)80060-X_BIB8"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB9","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","article-title":"Incremental concept formation algorithms based on Galois (concept) lattices","volume":"11","author":"Godin","year":"1995","journal-title":"Computational Intelligence"},{"year":"1975","series-title":"\u201cCluster Analysis,\u201d Wiley Series in Probability and Mathematical Statistics, New York","author":"Hartigan","key":"10.1016\/S1571-0661(05)80060-X_BIB10"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB11","first-page":"109","article-title":"Incrementally discovering association rules: a concept lattice approach","author":"Hu","year":"1999","journal-title":"Pacific-Aisa Conferenece on Knowledge Discovery and Data Mining"},{"year":"1955","series-title":"\u201cGeneral Topology,\u201d Van Nostrand, Princeton","author":"Kelley","key":"10.1016\/S1571-0661(05)80060-X_BIB12"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB13","series-title":"8th International Conference on Conceptual Structures (ICCS 2000), Darmstadt, Germany","article-title":"Fast concept analysis","author":"Lindig","year":"2000"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB14","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/32.824377","article-title":"Identifying modules via concept analysis","volume":"25","author":"Siff","year":"1999","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB15","series-title":"Proc. SIGSOFT Symposium on Foundations of Software Engineering, ACM","article-title":"Reengineering class hierarchies using concept analysis","author":"Snelting","year":"1998"},{"key":"10.1016\/S1571-0661(05)80060-X_BIB16","unstructured":"Wisconsin breast cancer data ftp:\/\/ftp.cs.wise.edu\/math-prog\/cpo-dataset\/machine-learn\/cancer1\/."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580060X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580060X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:54Z","timestamp":1761610134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610580060X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":16,"alternative-id":["S157106610580060X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80060-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2001,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Clusters, Concepts, and Pseudometrics","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80060-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}