{"entities":{"Q6994987":{"pageid":21472914,"ns":120,"title":"Item:Q6994987","lastrevid":76406094,"modified":"2026-04-23T23:49:49Z","type":"item","id":"Q6994987","labels":{"en":{"language":"en","value":"Clustering with minimum spanning trees: how good can it be?"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8029389"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6994987$4721CFB3-086E-464C-B588-6976778E3CFA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b8d39ac8dc21c0847e9df9cc90c3b9288c9a54ff","datavalue":{"value":{"text":"Clustering with minimum spanning trees: how good can it be?","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6994987$8545D84A-1F3F-44DA-8ECB-ED1C77D54BF4","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ecd29ca12ca11dbc82cc9fbf0e2285af8883ba50","datavalue":{"value":"10.1007/S00357-024-09483-1","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6994987$97786727-22CC-4E86-852D-DD2CB803E4AD","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"53b6ff21d1949de7dd5413ced9c5e5db570c2093","datavalue":{"value":{"entity-type":"item","numeric-id":80837,"id":"Q80837"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6994987$3C0EE0D8-607E-4376-A663-502864E40DF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"deb737b3a604261f82150b53902f79637ee71ed8","datavalue":{"value":{"entity-type":"item","numeric-id":529122,"id":"Q529122"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6994987$B12F5AD8-9B71-438D-8B15-6C22F8D0284B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"26d3cc032db5204c061cb063541fbe9f1a28f9f5","datavalue":{"value":{"entity-type":"item","numeric-id":5117241,"id":"Q5117241"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6994987$E5207660-3772-4F91-A345-3EA2BC362BB5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e3bdb72e99c51eb5559069483ed2fd5caacab881","datavalue":{"value":{"entity-type":"item","numeric-id":6994986,"id":"Q6994986"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6994987$AAD8D1E1-6061-48A4-81D9-BA04127A6C13","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2febee684711f4cb1a453192904f1a5144211493","datavalue":{"value":{"entity-type":"item","numeric-id":65457,"id":"Q65457"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6994987$4A33319C-79C5-4996-9E5E-985B15F42DF0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7f94f0c0a2717ce4f40eea9c072fbe52c006e4c4","datavalue":{"value":{"time":"+2025-04-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6994987$4741625A-753F-4FF9-9F56-F281C7B2D27D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"48a59f52dcfcc38cd6697e0ef07319031311895b","datavalue":{"value":"62H30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6994987$DB6215CF-7925-4BDF-B46A-B60902F752BC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"438e13043603f7cebc2d77e411dc6638a469721b","datavalue":{"value":"8029389","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6994987$8D07495F-B769-4909-9F8B-B2B9060B5889","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6994987$7759BB3D-DA24-4E6E-804C-D368AE72A0A6","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"18d5f45ec1d367ce4467e2404e2494fd2120d138","datavalue":{"value":"hierarchical partitional clustering","type":"string"},"datatype":"string"},"type":"statement","id":"Q6994987$0881F6FD-3120-4C12-BDD0-484ABEC4DB21","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"732e1592c53acfd9740f2cb8680bbb91fda5b0af","datavalue":{"value":"minimum spanning tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q6994987$710E3DF9-3BFA-4FE6-BF3E-7CC912317084","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e4586f599f127ca1744ec9c0d847049ca761fa6a","datavalue":{"value":"MST","type":"string"},"datatype":"string"},"type":"statement","id":"Q6994987$D9227AA8-1B53-45F5-BE3A-CAB1F6CFE2D0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"deab41fecd7b48500023ab851d8a3c80a337a9e5","datavalue":{"value":"cluster validity measure","type":"string"},"datatype":"string"},"type":"statement","id":"Q6994987$917455E4-35AD-4113-965B-0729B26072F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9b30b02bd4d1fc581b45f43a50e023d423d15c32","datavalue":{"value":"single linkage","type":"string"},"datatype":"string"},"type":"statement","id":"Q6994987$906484FF-5DD3-4C94-BDBA-AB80DE32D376","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"37f584342663ea8f1b40bc1596a807a3b1a2f183","datavalue":{"value":"Genie algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6994987$B7423E13-DA95-4929-ABF5-106278BB5584","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c51857c26a0b6d95e144454001a5ebde294ecbca","datavalue":{"value":"mutual information","type":"string"},"datatype":"string"},"type":"statement","id":"Q6994987$CAD913E3-A18D-474B-B318-954BA79622CC","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6994987$74FB3597-99F5-462C-B9FE-4E8340B51D1B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Clustering with minimum spanning trees: how good can it be?","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Clustering_with_minimum_spanning_trees:_how_good_can_it_be%3F"}}}}}