{"id":"https://openalex.org/W91358860","doi":"https://doi.org/10.1007/978-3-642-21916-0_39","title":"Pairwise Constraint Propagation for Graph-Based Semi-supervised Clustering","display_name":"Pairwise Constraint Propagation for Graph-Based Semi-supervised Clustering","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W91358860","doi":"https://doi.org/10.1007/978-3-642-21916-0_39","mag":"91358860"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-21916-0_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21916-0_39","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102718616","display_name":"Tetsuya Yoshida","orcid":"https://orcid.org/0000-0001-5262-9941"},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tetsuya Yoshida","raw_affiliation_strings":["Graduate School of Information Science and Technology, Hokkaido University, N-14 W-9, Sapporo, 060-0814, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Hokkaido University, N-14 W-9, Sapporo, 060-0814, Japan","institution_ids":["https://openalex.org/I205349734"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102718616"],"corresponding_institution_ids":["https://openalex.org/I205349734"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3726,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60171346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"358","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7686198949813843},{"id":"https://openalex.org/keywords/laplacian-matrix","display_name":"Laplacian matrix","score":0.7173743844032288},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6098350882530212},{"id":"https://openalex.org/keywords/spectral-clustering","display_name":"Spectral clustering","score":0.6065266728401184},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5695412158966064},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5427125096321106},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.46946704387664795},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.45424872636795044},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42153996229171753},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3875359296798706},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30065855383872986},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.28649216890335083},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.27949708700180054}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7686198949813843},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.7173743844032288},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6098350882530212},{"id":"https://openalex.org/C105611402","wikidata":"https://www.wikidata.org/wiki/Q2976589","display_name":"Spectral clustering","level":3,"score":0.6065266728401184},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5695412158966064},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5427125096321106},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.46946704387664795},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.45424872636795044},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42153996229171753},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3875359296798706},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30065855383872986},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.28649216890335083},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27949708700180054}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-21916-0_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21916-0_39","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1489381599","https://openalex.org/W1497288309","https://openalex.org/W1573811011","https://openalex.org/W1650751478","https://openalex.org/W2097308346","https://openalex.org/W2103788722","https://openalex.org/W2132914434","https://openalex.org/W2134089414","https://openalex.org/W2139106477","https://openalex.org/W2139224176","https://openalex.org/W2798588639"],"related_works":["https://openalex.org/W2607797544","https://openalex.org/W2902850141","https://openalex.org/W2197112176","https://openalex.org/W2885900820","https://openalex.org/W1556852487","https://openalex.org/W2136935487","https://openalex.org/W1955548541","https://openalex.org/W2265158691","https://openalex.org/W2032317191","https://openalex.org/W2964122166"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}