{"entities":{"Q6897688":{"pageid":20883595,"ns":120,"title":"Item:Q6897688","lastrevid":75490447,"modified":"2026-04-19T06:20:04Z","type":"item","id":"Q6897688","labels":{"en":{"language":"en","value":"An algorithm for clustering with confidence-based must-link and cannot-link constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8123890"}},"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":"Q6897688$22A2B9EC-C1C9-40CA-AC88-E5FBE2B0A98B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"fd18e81e0980c1b507d56804e761e19fa3aa3057","datavalue":{"value":{"text":"An algorithm for clustering with confidence-based must-link and cannot-link constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6897688$C3E56EC5-92A5-41BF-A23D-9B6DFB66940A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4dbc1430345b719744c4d18f0771d7629b631884","datavalue":{"value":"10.1287/IJOC.2023.0419","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6897688$ABE2FBE6-8FD4-477B-A6A4-E8510D4F4D47","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ddafb6fcda40dba10f1d4c7ee4e155a0653627c2","datavalue":{"value":{"entity-type":"item","numeric-id":2356281,"id":"Q2356281"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6897688$883D08D6-9609-462A-989E-5F90411F33E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5b969806e15667b8bb837290cff38032bdae579d","datavalue":{"value":{"entity-type":"item","numeric-id":242829,"id":"Q242829"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6897688$B0D1618F-B8D9-4809-A10D-3F4606C5F31C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f030fff290cba9104f71fb1447bb02747b898e5f","datavalue":{"value":{"entity-type":"item","numeric-id":74741,"id":"Q74741"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6897688$683A4462-3F99-467F-ABF0-A21997D3E620","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"804cb8321879b3a50f4d87280bc7c6e87039f39c","datavalue":{"value":{"time":"+2025-11-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6897688$3220D75F-1B41-4EEA-87A8-47BDDDF2083C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"30e0158d39e8dcc6ee00ca7b3ae626e5899d5903","datavalue":{"value":"90Cxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6897688$5D8DCF3A-92CA-4005-B361-2BB6B8679DE4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b189dbab3e1f90aa46fa4bf18be8309263fec5d4","datavalue":{"value":"8123890","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6897688$1CA33A0A-1D69-4826-A533-F0C6B55D987D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e0afe30fcd4cd25e8e8273c02ad48a97b4a0e001","datavalue":{"value":"machine learning","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897688$BB0051AD-3D6C-417B-B719-A1ABE7430E0C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"63c6ba5ca3dcc8051660bbdd589f9ea527592975","datavalue":{"value":"semisupervised learning","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897688$30273E40-40A4-4051-ADDA-801DE9313860","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b12fb7ef0618e0b7143670a1a69a4af2f47326b7","datavalue":{"value":"must-link and cannot-link constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897688$BE544790-D1CB-4D46-9307-3192219D0F5A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9c0d4a5911c275bca508a74517fe277ee584c2ec","datavalue":{"value":"confidence levels","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897688$82EFE0DE-1AAD-42D2-A6A5-B3868B4A5F6D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6e0a438e9092bcf192a5c493b52b0717e88c2591","datavalue":{"value":"integer programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897688$9047DBC5-9B68-4547-9B86-10240CC7CBCD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"42e6aa98426aef067464fc7d00396246df69032b","datavalue":{"value":"constrained clustering","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897688$8B376011-E080-48A2-8158-0CA57B2A1959","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":"Q6897688$0749C39B-D650-4CCA-BA23-707146A92ECC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for clustering with confidence-based must-link and cannot-link constraints","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_clustering_with_confidence-based_must-link_and_cannot-link_constraints"}}}}}