{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:39:20Z","timestamp":1763663960280,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030177041"},{"type":"electronic","value":"9783030177058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17705-8_2","type":"book-chapter","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T19:11:21Z","timestamp":1555528281000},"page":"19-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Agglomerative Method for Texts Clustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7641-956X","authenticated-orcid":false,"given":"Andrey V.","family":"Orekhov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Clark S.: Vector space models of lexical meaning. In: Handbook of Contemporary Semantics, 2nd edn. Blackwell, Oxford (2014)","DOI":"10.1002\/9781118882139.ch16"},{"key":"2_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470977811","volume-title":"Cluster Analysis","author":"BS Everitt","year":"2011","unstructured":"Everitt, B.S.: Cluster Analysis, 5th edn. Wiley, Chichester (2011)","edition":"5"},{"key":"2_CR3","volume-title":"Pattern Classification","author":"RO Duda","year":"2001","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley, New York (2001)","edition":"2"},{"key":"2_CR4","first-page":"1","volume":"3","author":"T Calirnski","year":"1974","unstructured":"Calirnski, T., Harabasz, J.: A dendrite method for cluster analysis. Commun. Stat. 3, 1\u201327 (1974)","journal-title":"Commun. Stat."},{"key":"2_CR5","unstructured":"Baxter, M.J.: Exploratory Multivariate Analysis in Archaeology. Edinburgh (1994)"},{"issue":"463","key":"2_CR6","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1198\/016214503000000666","volume":"98","author":"CA Sugar","year":"2003","unstructured":"Sugar, C.A., James, G.M.: Finding the number of clusters in a dataset. J. Am. Stat. Assoc. 98(463), 750\u2013763 (2003)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1134\/S0005117911040072","volume":"72","author":"ON Granichin","year":"2011","unstructured":"Granichin, O.N., Shalymov, D.S., Avros, R., Volkovich, Z.: A randomized algorithm for estimating the number of clusters. Autom. Remote Control 72(4), 754\u2013765 (2011)","journal-title":"Autom. Remote Control"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-23166-7_6","volume":"23","author":"R Avros","year":"2012","unstructured":"Avros, R., Granichin, O., Shalymov, D., Volkovich, Z., Weber, G.-W.: Randomized algorithm of finding the true number of clusters based on Chebychev polynomial approximation. Intell. Syst. Ref. Libr. 23, 131\u2013155 (2012)","journal-title":"Intell. Syst. Ref. Libr."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2018.04.016","volume":"145","author":"G Zhang","year":"2018","unstructured":"Zhang, G., Zhang, C., Zhang, H.: Improved K-means algorithm based on density Canopy. Knowl.-Based Syst. 145, 1\u201314 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Jiali, W., Yue, Z., Xv, L.: Automatic cluster number selection by finding density peaks. In: 2nd IEEE International Conference on Computer and Communications, ICCC 2016 \u2013 Proceedings, pp. 13\u201318 (2017). https:\/\/doi.org\/10.1109\/CompComm.2016.7924655","DOI":"10.1109\/CompComm.2016.7924655"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ins.2015.06.039","volume":"324","author":"RC Amorim de","year":"2015","unstructured":"de Amorim, R.C., Hennig, C.: Recovering the number of clusters in data sets with noise features using feature rescaling factors. Information Sciences. 324, 126\u2013145 (2015)","journal-title":"Information Sciences."},{"issue":"4","key":"2_CR12","first-page":"398","volume":"13","author":"A Lozkins","year":"2017","unstructured":"Lozkins, A., Bure, V.M.: Single hub location-allocation problem under robustness clustering concept. Vestnik Sankt-Peterburgskogo Universiteta, Prikladnaya Matematika, Informatika, Protsessy Upravleniya 13(4), 398\u2013406 (2017)","journal-title":"Vestnik Sankt-Peterburgskogo Universiteta, Prikladnaya Matematika, Informatika, Protsessy Upravleniya"},{"key":"2_CR13","first-page":"801","volume":"IV","author":"H Steinhaus","year":"1956","unstructured":"Steinhaus, H.: Sur la division des corps materiels en parties. Bull. Acad. Polon. Sci. IV, 801\u2013804 (1956)","journal-title":"Bull. Acad. Polon. Sci."},{"key":"2_CR14","unstructured":"Lloyd S.: Least square quantization in PCM\u2019s. Bell Telephone Laboratories Paper (1957)"},{"key":"2_CR15","volume-title":"Clustering Algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)"},{"key":"2_CR16","doi-asserted-by":"publisher","DOI":"10.4135\/9781412983648","volume-title":"Cluster Analysis","author":"MS Aldenderfer","year":"1984","unstructured":"Aldenderfer, M.S., Blashfield, R.K.: Cluster Analysis. Sage Publications, Beverly Hills (1984)"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Orekhov, A.V.: Criterion for estimation of stress-deformed state of SD-materials. In: AIP Conference Proceedings, vol. 1959, p. 070028 (2018). https:\/\/doi.org\/10.1063\/1.5034703","DOI":"10.1063\/1.5034703"},{"issue":"8","key":"2_CR18","first-page":"62","volume":"30","author":"J McCaffrey","year":"2015","unstructured":"McCaffrey, J.: Test run \u2013 k-means++ data clustering. MSDN Mag. 30(8), 62\u201368 (2015)","journal-title":"MSDN Mag."},{"key":"2_CR19","doi-asserted-by":"crossref","DOI":"10.4324\/9781410602428","volume-title":"Fundamentals of Media Effects","author":"J Bryant","year":"2002","unstructured":"Bryant, J., Thompson, S.: Fundamentals of Media Effects. McGraw-Hill, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Internet Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17705-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,23]],"date-time":"2019-11-23T16:23:14Z","timestamp":1574526194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17705-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030177041","9783030177058"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17705-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INSCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Internet Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"insci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/insci2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3.25","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}