CINXE.COM

<!DOCTYPE html> <html lang="en"> <head><meta charset="UTF-8"><title>dblp: Maria Halkidi</title><link rel="home" href="https://dblp.org"><link rel="search" type="application/opensearchdescription+xml" href="https://dblp.org/xml/osd.xml" title="dblp search"><link rel="apple-touch-icon" type="image/png" sizes="192x192" href="https://dblp.org/img/dblp.icon.192x192.png"><link rel="icon" type="image/png" sizes="192x192" href="https://dblp.org/img/dblp.icon.192x192.png"><link rel="icon" type="image/png" sizes="152x152" href="https://dblp.org/img/dblp.icon.152x152.png"><link rel="icon" type="image/png" sizes="120x120" href="https://dblp.org/img/dblp.icon.120x120.png"><link id="favicon" rel="shortcut icon" type="image/x-icon" sizes="16x16 24x24 32x32 64x64" href="https://dblp.org/img/favicon.ico"><link rel="stylesheet" type="text/css" href="https://dblp.org/css/dblp-2024-07-09.css"><link href="https://dblp.org/css/open-sans.css" rel="stylesheet" type="text/css"><link rel="canonical" href="https://dblp.org/pid/99/5919"><link rel="alternate" type="text/html" title="person page HTML" href="https://dblp.org/pid/99/5919.html"><link rel="alternate" type="application/xml" title="person page XML" href="https://dblp.org/pid/99/5919.xml"><link rel="alternate" type="application/rdf+xml" title="person page RDF/XML" href="https://dblp.org/pid/99/5919.rdf"><link rel="alternate" type="application/n-triples" title="person page RDF N-Triples" href="https://dblp.org/pid/99/5919.nt"><link rel="alternate" type="text/turtle" title="person page RDF Turtle" href="https://dblp.org/pid/99/5919.ttl"><link rel="alternate" type="application/rss+xml" title="bibliography update RSS feed" href="https://dblp.org/pid/99/5919.rss"><link rel="alternate" type="application/x-bibtex" title="person page BibTeX" href="https://dblp.org/pid/99/5919.bib"><link rel="alternate" type="application/x-research-info-systems" title="person page RIS" href="https://dblp.org/pid/99/5919.ris"><meta name="description" content="List of computer science publications by Maria Halkidi"><meta name="keywords" content="Maria Halkidi, dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex"><script type="application/ld+json">{"@context": "http://schema.org","@type": "WebSite","url": "https://dblp.org","sameAs": ["https://dblp.uni-trier.de","https://dblp.dagstuhl.de","https://www.wikidata.org/entity/Q1224715","https://en.wikipedia.org/wiki/DBLP","https://twitter.com/dblp_org","https://facebook.com/dblp.org"],"name": "dblp computer science bibliography","alternateName": "DBLP","description": "The dblp computer science bibliography is the online reference for open bibliographic information on major computer science journals and proceedings.","image": "https://dblp.org/img/logo.320x120.png","thumbnailUrl": "https://dblp.org/img/dblp.icon.192x192.png","creator": {"@context": "http://schema.org","@type": "Organization","name": "Schloss Dagstuhl - Leibniz Center for Informatics","url": "https://www.dagstuhl.de","logo": "https://www.dagstuhl.de/fileadmin/assets/images/lzi_logo.gif","contactPoint": {"@context": "http://schema.org","@type": "ContactPoint","contactType": "customer support","url": "https://dblp.org/db/about/team","email": "dblp@dagstuhl.de"},"sameAs": ["https://www.wikidata.org/entity/Q879857","https://en.wikipedia.org/wiki/Dagstuhl"]},"dateCreated": "1993","datePublished": "1993","dateModified": "2025-02-16","locationCreated": "Trier, Germany","funder": [{"@context": "http://schema.org","@type": "Organization","name": "Leibniz Association","url": "https://www.leibniz-gemeinschaft.de/","logo": "https://www.leibniz-gemeinschaft.de/fileadmin/portal/logo-black.svg","sameAs": ["https://www.wikidata.org/entity/Q680090","https://en.wikipedia.org/wiki/Leibniz_Association"]},{"@context": "http://schema.org","@type": "Organization","name": "Federal Ministry of Education and Research of Germany","url": "https://www.bmbf.de/","logo": "https://www.bmbf.de/site/img/logo.png","sameAs": ["https://www.wikidata.org/entity/Q492234","https://en.wikipedia.org/wiki/Federal_Ministry_of_Education_and_Research_(Germany)"]},{"@context": "http://schema.org","@type": "Organization","name": "Saarland State Chancellery","url": "https://www.saarland.de/stk/DE/home/home_node.html","logo": "https://www.saarland.de/bilder/res_stk/stk.png","sameAs": ["https://www.wikidata.org/entity/Q15848758","https://de.wikipedia.org/wiki/Saarl%C3%A4ndische_Staatskanzlei"]},{"@context": "http://schema.org","@type": "Organization","name": "Ministry of Science, Education and Culture of the State of Rhineland-Palatinate","url": "https://mwwk.rlp.de/de/startseite//","logo": "https://mwwk.rlp.de/fileadmin/_logos/rlp-logos-MWWK.png","sameAs": ["https://www.wikidata.org/entity/Q15835282","https://de.wikipedia.org/wiki/Ministerium_f%C3%BCr_Wissenschaft,_Weiterbildung_und_Kultur"]}],"genre": "computer science","inLanguage": "en-US","license": "https://creativecommons.org/publicdomain/zero/1.0/","isAccessibleForFree": "true","potentialAction": [{"@type": "SearchAction","target": "https://dblp.org/search?q={search_term_string}","query-input": "required name=search_term_string"}]}</script><script type="application/ld+json">{"@context": "http://schema.org","@type": "Dataset","url": "https://dblp.org/xml/release","sameAs": ["https://dblp.uni-trier.de/xml/release","https://dblp.dagstuhl.de/xml/release"],"name": "dblp XML data dump","description": "The raw dblp metadata in XML files as stable, persistent releases.","keywords": "dblp, XML, computer science, scholarly publications, metadata","temporalCoverage": "1936/..","thumbnailUrl": "https://dblp.org/img/dblp.icon.192x192.png","creator": {"@context": "http://schema.org","@type": "Organization","name": "Schloss Dagstuhl - Leibniz Center for Informatics","url": "https://www.dagstuhl.de","logo": "https://www.dagstuhl.de/fileadmin/assets/images/lzi_logo.gif","contactPoint": {"@context": "http://schema.org","@type": "ContactPoint","contactType": "customer support","url": "https://dblp.org/db/about/team","email": "dblp@dagstuhl.de"},"sameAs": ["https://www.wikidata.org/entity/Q879857","https://en.wikipedia.org/wiki/Dagstuhl"]},"dateCreated": "1993","datePublished": "1993","dateModified": "2025-02-16","locationCreated": "Trier, Germany","funder": [{"@context": "http://schema.org","@type": "Organization","name": "Leibniz Association","url": "https://www.leibniz-gemeinschaft.de/","logo": "https://www.leibniz-gemeinschaft.de/fileadmin/portal/logo-black.svg","sameAs": ["https://www.wikidata.org/entity/Q680090","https://en.wikipedia.org/wiki/Leibniz_Association"]},{"@context": "http://schema.org","@type": "Organization","name": "Federal Ministry of Education and Research of Germany","url": "https://www.bmbf.de/","logo": "https://www.bmbf.de/site/img/logo.png","sameAs": ["https://www.wikidata.org/entity/Q492234","https://en.wikipedia.org/wiki/Federal_Ministry_of_Education_and_Research_(Germany)"]},{"@context": "http://schema.org","@type": "Organization","name": "Saarland State Chancellery","url": "https://www.saarland.de/staatskanzlei.htm","logo": "https://www.saarland.de/bilder/res_stk/stk.png","sameAs": ["https://www.wikidata.org/entity/Q15848758","https://de.wikipedia.org/wiki/Saarl%C3%A4ndische_Staatskanzlei"]},{"@context": "http://schema.org","@type": "Organization","name": "Ministry of Science, Education and Culture of the State of Rhineland-Palatinate","url": "https://mwwk.rlp.de/de/startseite//","logo": "https://mwwk.rlp.de/fileadmin/_logos/rlp-logos-MWWK.png","sameAs": ["https://www.wikidata.org/entity/Q15835282","https://de.wikipedia.org/wiki/Ministerium_f%C3%BCr_Wissenschaft,_Weiterbildung_und_Kultur"]}],"genre": "computer science","inLanguage": "en-US","license": "https://creativecommons.org/publicdomain/zero/1.0/","isAccessibleForFree": "true","distribution": [{"@type": "DataDownload","encodingFormat": "application/gzip","contentUrl": "https://dblp.org/xml/release/"}]}</script></head> <body class="no-js pers-page" data-dblp-path="pers/99/5919" itemscope itemtype="http://schema.org/Person"> <link itemprop="additionalType" href="https://dblp.org/rdf/schema#Person"> <script>var el = document.getElementsByTagName("body")[0];el.classList.remove('no-js');el.classList.add('js');</script> <script src="https://dblp.org/js/jquery-3.1.1.min.js"></script> <script src="https://dblp.org/js/jquery.dblp-2014-08-07.min.js"></script> <script src="https://dblp.org/js/jquery.cookie-1.4.1.min.js"></script> <script src="https://dblp.org/js/jquery.mark-9.0.0-edited.min.js"></script> <script src="https://dblp.org/js/jquery.md5-1.2.1.min.js"></script> <script src="https://dblp.org/js/d3-3.5.5.min.js"></script> <script src="https://dblp.org/js/encoder-2012-09-23.min.js"></script> <script src="https://dblp.org/js/buckets-1.0.min.js"></script> <div id="navbar"><a href="https://www.dagstuhl.de/en"><img class="logo" src="https://dblp.org/img/lzi-logo.82x57.png" alt="Schloss Dagstuhl - Leibniz Center for Informatics" title="Schloss Dagstuhl - Leibniz Center for Informatics"></a><nav><ul><li class="navbar-dropdown"><div class="head"><a href="https://dblp.org">dblp</a></div><div class="body"><ul><li><a href="https://blog.dblp.org">Blog</a></li><li><a href="https://dblp.org/statistics/">Statistics</a></li><li class="seperator"></li><li><a href="https://dblp.org/feed/">Update feed</a></li><li><a href="https://dblp.org/xml/">XML dump</a></li><li><a href="https://dblp.org/rdf/">RDF dump</a></li></ul></div></li><li class="navbar-dropdown"><div class="head"><a href="https://dblp.org/db/">browse</a></div><div class="body"><ul><li><a href="https://dblp.org/pers/">Persons</a></li><li class="seperator"></li><li><a href="https://dblp.org/db/conf/">Conferences</a></li><li><a href="https://dblp.org/db/journals/">Journals</a></li><li><a href="https://dblp.org/db/series/">Series</a></li><li><a href="https://dblp.org/db/repo/">Repositories</a></li></ul></div></li><li class="navbar-dropdown"><div class="head"><a href="https://dblp.org/search/">search</a></div><div class="body"><ul><li><a href="https://dblp.org/search/">Search dblp</a></li><li><a href="https://sparql.dblp.org">SPARQL queries</a> <img alt="" src="https://dblp.org/img/new.blue.24x12.png"></li><li class="seperator"></li><li><a href="https://dblp.org/lookup/">Lookup by ID</a></li></ul></div></li><li class="navbar-dropdown"><div class="head"><a href="https://dblp.org/db/about/">about</a></div><div class="body"><ul><li><a href="https://dblp.org/faq/">F.A.Q.</a></li><li><a href="https://dblp.org/db/about/team.html">Team</a></li><li><a href="https://dblp.org/db/about/advisoryboard.html">Advisory Board</a></li><li class="seperator"></li><li><a href="https://dblp.org/db/about/copyright.html">License</a></li><li><a href="https://dblp.org/db/about/privacy.html">Privacy</a></li><li><a href="https://dblp.org/db/about/imprint.html">Imprint</a></li></ul></div></li><li class="navbar-dropdown"><div class="head"><a class="external" href="https://www.nfdi.de/?lang=en">nfdi</a></div><div class="body"><ul><li><a class="external" href="https://www.nfdi.de/?lang=en"><strong>NFDI - National Research Data Infrastructure Germany</strong></a></li><li><a class="external" href="https://www.nfdi.de/consortia/?lang=en">consortia</a></li><li class="seperator"></li><li><a class="external" href="https://nfdixcs.org/"><img class="icon" alt="" src="https://dblp.org/img/nfdixcs.color.16x16.png"><strong>NFDIxCS</strong></a></li><li><a class="external" href="https://nfdixcs.org/veranstaltungen">events</a> | <a class="external" href="https://twitter.com/nfdixcs">twitter</a></li><li class="seperator"></li><li><a class="external" href="https://www.nfdi4datascience.de/"><img class="icon" alt="" src="https://dblp.org/img/nfdi4ds.color.16x16.png"><strong>NFDI4DataScience</strong></a></li><li><a class="external" href="https://www.orkg.org">ORKG</a></li><li><a class="external" href="http://ceur-ws.org/">CEUR</a></li><li><a class="external" href="https://mybinder.org/">MyBinder</a></li><li><a class="external" href="https://www.nfdi4datascience.de/events/">events</a> | <a class="external" href="https://twitter.com/nfdi4ds">twitter</a> | <a class="external" href="https://scholar.google.com/citations?user=MB2fMGEAAAAJ">publications</a></li></ul></div></li></ul></nav> <nav class="stop-the-war"><ul><li class="navbar-dropdown"><div class="head"><img alt="" class="icon" src="https://dblp.org/img/peace.dark.16x16.png">stop the war!</div><div class="body"><ul><li><img alt="" class="icon" src="https://dblp.org/img/peace.dark.16x16.png">Зупиніть війну!</li><li><img alt="" class="icon" src="https://dblp.org/img/peace.dark.16x16.png">Остановите войну!</li><li><a class="external" href="https://www.leibniz-gemeinschaft.de/en/about-us/whats-new/news/forschungsnachrichten-single/newsdetails/solidaritaet-mit-der-ukraine">solidarity</a> - <a class="external" href="https://www-leibniz--gemeinschaft-de.translate.goog/en/about-us/whats-new/news/forschungsnachrichten-single/newsdetails/solidaritaet-mit-der-ukraine?_x_tr_sl=en&_x_tr_tl=uk">(ua)</a> - <a class="external" href="https://www-leibniz--gemeinschaft-de.translate.goog/en/about-us/whats-new/news/forschungsnachrichten-single/newsdetails/solidaritaet-mit-der-ukraine?_x_tr_sl=en&_x_tr_tl=ru">(ru)</a></li><li><a class="external" href="https://news.un.org/en/tags/ukraine">news</a> - <a class="external" href="https://news-un-org.translate.goog/en/tags/ukraine?_x_tr_sl=en&_x_tr_tl=uk">(ua)</a> - <a class="external" href="https://news-un-org.translate.goog/en/tags/ukraine?_x_tr_sl=en&_x_tr_tl=ru">(ru)</a></li><li><a class="external" href="https://donate.unhcr.org/int/en/ukraine-emergency">donate</a> - <a class="external" href="https://www.doctorswithoutborders.org/what-we-do/where-we-work/ukraine">donate</a> - <a class="external" href="https://www.icrc.org/en/where-we-work/europe-central-asia/ukraine">donate</a></li><li class="seperator"></li><li><strong>for scientists</strong></li><li><a class="external" href="https://euraxess.ec.europa.eu/ukraine/">ERA4Ukraine</a></li><li><a class="external" href="https://www.daad-ukraine.org/en/">Assistance in Germany</a></li><li><a class="external" href="https://uglobal.university/">Ukrainian Global University</a></li><li><a class="external" href="https://twitter.com/hashtag/ScienceForUkraine?f=live">#ScienceForUkraine</a></li></ul></div></li></nav></div><div id="banner">   <div class="message fancy" data-version="2024-09-09" data-nosnippet>We've just launched a new service: our brand new <a href="https://sparql.dblp.org"><b>dblp SPARQL query service</b></a>. Read more about it in <a href="https://blog.dblp.org/2024/09/09/introducing-our-public-sparql-query-service/">our latest blog post</a> or try out some of the SPARQL queries linked on the dblp web pages below.</div> </div><div id="main"> <div id="logo"><img class="logo" usemap="#logo-map" src="https://dblp.org/img/logo.320x120.png" alt=""><map name="logo-map"><area href="https://dblp.org" shape="poly" coords="5,0,14,92,103,118,111,95,319,90,316,61,192,63,190,26,99,26" alt="dblp computer science bibliography" title="dblp computer science bibliography"></map></div> <div id="search"><img src="https://dblp.org/img/search.dark.16x16.png" class="icon no-js-only" title="search dblp" alt="search dblp"><div id="search-mode-selector" class="drop-down js-only" style="vertical-align:-6px; margin-right:1px;"><div class="head"><img src="https://dblp.org/img/search.dark.16x16.png" class="icon" alt="search dblp"></div><div class="body"><p><b>default search action</b></p><ul><li><input id="search-mode-combined" type="radio" name="search-mode" value="c" checked="checked"><label for="search-mode-combined">combined dblp search</label></li><li><input id="search-mode-author" type="radio" name="search-mode" value="a"><label for="search-mode-author">author search</label></li><li><input id="search-mode-venue" type="radio" name="search-mode" value="v"><label for="search-mode-venue">venue search</label></li><li><input id="search-mode-publ" type="radio" name="search-mode" value="p"><label for="search-mode-publ">publication search</label></li></ul></div></div><form method="get" action="https://dblp.org/search"><input type="search" name="q" maxlength="127" placeholder="search dblp"><div class="results js-only"><div class="authors"><b>Authors:</b><ul class="matches"><li><i>no matches</i></li></ul><ul class="waiting"><li><img src="https://dblp.org/img/waiting.anim.gif" alt="waiting..."></li></ul></div><div class="venues"><b>Venues:</b><ul class="matches"><li><i>no matches</i></li></ul><ul class="waiting"><li><img src="https://dblp.org/img/waiting.anim.gif" alt="waiting..."></li></ul></div><div class="publs"><b>Publications:</b><ul class="matches"><li><i>no matches</i></li></ul><ul class="waiting"><li><img src="https://dblp.org/img/waiting.anim.gif" alt="waiting..."></li></ul></div></div><img class="clear js-only" src="https://dblp.org/img/clear-mark.medium.16x16.png" alt="clear" title="clear"></form><div id="search-external" class="drop-down js-only"><div class="head"><a href="https://google.com/search?q="><img src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon" alt="ask others"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q="><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q="><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q="><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q="><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query="><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://orcid.org/orcid-search/search?searchQuery="><img alt="" src="https://dblp.org/img/orcid.dark.16x16.png" class="icon">ORCID</a></li></ul></div> </div> </div> <header id="headline" data-name="Maria Halkidi" data-pid="99/5919"><h1><span class="name primary" itemprop="name">Maria Halkidi</span></h1> <nav class="head"><ul><li class="orcid drop-down"><div class="head"><a href="https://orcid.org/0000-0001-6282-824X"><img alt="" src="https://dblp.org/img/orcid.color.16x16.png" class="icon"></a></div><div class="body"><p><b>ORCID</b></p><ul><li><a href="https://orcid.org/0000-0001-6282-824X" itemprop="sameAs"><img alt="" src="https://dblp.org/img/orcid.color.16x16.png" class="icon">0000-0001-6282-824X</a></li></ul></div></li><li class="visit drop-down"><div class="head"><a href="http://www.unipi.gr/faculty/mhalk/index.htm"><img alt="" src="https://dblp.org/img/person.light.16x16.png" class="icon"></a></div><div class="body"><p><b>visit</b></p><ul><li itemprop="subjectOf" itemscope itemtype="http://schema.org/WebPage"><a href="http://www.unipi.gr/faculty/mhalk/index.htm" itemprop="url"><img alt="" src="https://dblp.org/img/home.dark.16x16.png" class="icon">author's page @ unipi.gr</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://orcid.org/0000-0001-6282-824X" itemprop="sameAs"><img alt="ORCID" src="https://dblp.org/img/orcid.dark.16x16.png" class="icon" title="ORCID"></a></li></ul></div></li><li class="export drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.light.16x16.png" class="icon"></a></div><div class="body"><p><b>export bibliography</b></p><ul><li><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/pid/99/5919.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/pid/99/5919.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/pid/99/5919.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/pid/99/5919.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/pid/99/5919.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li><li><a rel="nofollow" href="https://dblp.org/pid/99/5919.rss"><img alt="" src="https://dblp.org/img/rss.dark.16x16.png" class="icon">RSS</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>homepages/99/5919</small></li></ul></div></li><li class="search drop-down"><div class="head"><a href="https://google.com/search?q=Maria+Halkidi"><img alt="" src="https://dblp.org/img/search-external.light.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Maria+Halkidi"><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Maria+Halkidi"><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Maria+Halkidi"><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Maria+Halkidi"><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Maria+Halkidi"><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://orcid.org/orcid-search/search?searchQuery=Maria+Halkidi"><img alt="" src="https://dblp.org/img/orcid.dark.16x16.png" class="icon">ORCID</a></li></ul></div></li><li class="share drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https://dblp.org/pid/99/5919&text=Maria+Halkidi%27s+publications+at&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.light.16x16.png" class="icon"></a></div><div class="body"><p><b>share bibliography</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https://dblp.org/pid/99/5919&text=Maria+Halkidi%27s+publications+at&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https://dblp.org/pid/99/5919&title=Maria+Halkidi%27s+publications+at+dblp"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editBookmark?url=https://dblp.org/pid/99/5919"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https://dblp.org/pid/99/5919&title=Maria+Halkidi%27s+publications+at+dblp&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https://dblp.org/pid/99/5919"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/pid/99/5919">https://dblp.org/pid/99/5919</a></small></li></ul></div></li><li class="help drop-down"><div class="head"><a href="https://dblp.org/db/about/team.html"><img alt="" src="https://dblp.org/img/talk.light.16x16.png" class="icon"></a></div><div class="body"><p><b>help us</b></p><ul><li><a href="https://dblp.org/faq/1474623"><img alt="" src="https://dblp.org/img/faq-mark.dark.16x16.png" class="icon">How can I correct errors in dblp?</a></li><li><a href="https://dblp.org/db/about/team.html"><img alt="" src="https://dblp.org/img/mail.dark.16x16.png" class="icon">contact dblp</a></li></ul></div></li></ul></nav></header> <nav class="side"><ul><li><a href="#" title="jump to top"><img alt="top" src="https://dblp.org/img/top.dark.16x16.png" class="icon"></a></li><li class="underline" title="jump to the 2020s"><a href="#the2020s"><span class="generic-icon"><small>'20</small></span></a></li><li class="underline" title="jump to the 2010s"><a href="#the2010s"><span class="generic-icon"><small>'10</small></span></a></li><li class="underline" title="jump to the 2000s"><a href="#the2000s"><span class="generic-icon"><small>'00</small></span></a></li><li><a title="jump to Coauthor Index" href="#coauthors"><img alt="coauthors" class="icon" src="https://dblp.org/img/coauthor.dark.16x16.png"></a></li><li><a href="#footer" title="jump to bottom"><img alt="bottom" src="https://dblp.org/img/bottom.dark.16x16.png" class="icon"></a></li></ul></nav> <nav id="mirror-selector" class="selector-box"><img src="https://dblp.org/img/datastock.dark.16x16.png" alt="mirror" title="use mirror server"><div class="drop-down selector"><div class="head">Dagstuhl</div><div class="body"><ul class="options"><li><a href="https://dblp.uni-trier.de/pid/99/5919.html?view=by-year">Trier</a></li></ul></div></div></nav> <nav id="sorting-selector" class="selector-box"><img src="https://dblp.org/img/eye.dark.16x16.png" alt="order" title="order publications by"><div class="drop-down selector"><div class="head">by year</div><div class="body"><ul class="options"><li><a href="https://dblp.org/pid/99/5919.html?view=by-type">by type</a></li></ul></div></div></nav> <div id="breadcrumbs" class="section"><ul><li itemscope itemtype="http://schema.org/BreadcrumbList"><span itemprop="itemListElement" itemscope itemtype="http://schema.org/ListItem">> <a itemprop="item" href="https://dblp.org"><span itemprop="name">Home</span></a><meta itemprop="position" content="1"></span> <span itemprop="itemListElement" itemscope itemtype="http://schema.org/ListItem">> <a itemprop="item" href="https://dblp.org/pers/"><span itemprop="name">Persons</span></a><meta itemprop="position" content="2"></span> </li></ul></div> <div class="clear-both"></div><div id="info-section" class="section"><div class="profile display-none hideable tts-content"><header class="hide-head h2 sub" id="profile"><h2>Person information</h2></header><div class="hide-body"></div></div><div style="clear:both"></div></div> <div id="publ-side-panel" class="panel js-only"><div id="authorpage-sparql" class="hideable"><header class="hide-head h2"><h2>SPARQL queries <img alt="" src="https://dblp.org/img/new.blue.24x12.png"></h2></header><div class="hide-body"><div class="stat-seg queries"><p><b>run query for this person</b></p><ul class="options"><li><a rel="nofollow" href="https://sparql.dblp.org?exec=true&query=%23%23+Highly+cited+coauthors+of+Maria+Halkidi%0APREFIX+dblp%3A+%3Chttps%3A%2F%2Fdblp.org%2Frdf%2Fschema%23%3E%0APREFIX+cito%3A+%3Chttp%3A%2F%2Fpurl.org%2Fspar%2Fcito%2F%3E%0APREFIX+rdfs%3A+%3Chttp%3A%2F%2Fwww.w3.org%2F2000%2F01%2Frdf-schema%23%3E%0ASELECT+%3Fname+%3Faffiliation+%28COUNT%28DISTINCT+%3Fcite%29+as+%3Fcites%29+%28%3Fcoauthor+as+%3Fdblp%29+%28SAMPLE%28%3Forcids%29+as+%3Forcid%29+WHERE+%7B%0A++VALUES+%3Fauthor+%7B+%3Chttps%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919%3E+%7D%0A++%3Fcopubl+dblp%3AauthoredBy+%3Fauthor+.%0A++%3Fcopubl+dblp%3AauthoredBy+%3Fcoauthor+.%0A++FILTER+%28+%3Fauthor+%21%3D+%3Fcoauthor+%29+.%0A++%3Fcoauthor+rdfs%3Alabel+%3Fname+.%0A++OPTIONAL+%7B+%3Fcoauthor+dblp%3Aorcid+%3Forcids+.+%7D%0A++OPTIONAL+%7B+%3Fcoauthor+dblp%3AprimaryAffiliation+%3Faffiliation+.+%7D%0A++%3Fpubl+dblp%3AauthoredBy+%3Fcoauthor+.%0A++%3Fpubl+dblp%3Aomid+%3Fomid+.%0A++%3Fcite+cito%3AhasCitedEntity+%3Fomid+.%0A%7D%0AGROUP+BY+%3Fname+%3Faffiliation+%3Fcoauthor%0AORDER+BY+DESC%28%3Fcites%29%0ALIMIT+10">highly cited coauthors</a></li><li><a rel="nofollow" href="https://sparql.dblp.org?exec=true&query=%23%23+Papers+that+cite+Maria+Halkidi+do+also+cite+...%0APREFIX+dblp%3A+%3Chttps%3A%2F%2Fdblp.org%2Frdf%2Fschema%23%3E%0APREFIX+cito%3A+%3Chttp%3A%2F%2Fpurl.org%2Fspar%2Fcito%2F%3E%0APREFIX+rdfs%3A+%3Chttp%3A%2F%2Fwww.w3.org%2F2000%2F01%2Frdf-schema%23%3E%0ASELECT+%3Fname+%3Faffiliation+%28COUNT%28%3Fother_pers%29+as+%3Ffreq%29+%28%3Fother_pers+as+%3Fdblp%29+%28SAMPLE%28%3Forcids%29+as+%3Forcid%29+WHERE+%7B%0A++VALUES+%3Fthis_pers+%7B+%3Chttps%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919%3E+%7D+.%0A++%3Fthis_publ+dblp%3AauthoredBy+%3Fthis_pers+.%0A++%3Fthis_publ+dblp%3Aomid+%3Fthis_omid+.%0A++%3Fthis_cite+cito%3AhasCitedEntity+%3Fthis_omid+.%0A++%3Fthis_cite+cito%3AhasCitingEntity+%3Fsource_omid+.%0A++%3Fother_cite+cito%3AhasCitingEntity+%3Fsource_omid+.%0A++%3Fother_cite+cito%3AhasCitedEntity+%3Fother_omid+.%0A++FILTER%28+%3Fother_omid+%21%3D+%3Fthis_omid+%29+.%0A++%3Fother_publ+dblp%3Aomid+%3Fother_omid+.%0A++%3Fother_publ+dblp%3AauthoredBy+%3Fother_pers+.%0A++FILTER%28+%3Fother_pers+%21%3D+%3Fthis_pers+%29+.%0A++%3Fother_pers+dblp%3AprimaryCreatorName+%3Fname+.%0A++OPTIONAL+%7B+%3Fother_pers+dblp%3AprimaryAffiliation+%3Faffiliation+.+%7D%0A++OPTIONAL+%7B+%3Fother_pers+dblp%3Aorcid+%3Forcids+.+%7D%0A%7D%0AGROUP+BY+%3Fname+%3Faffiliation+%3Fother_pers%0AORDER+BY+DESC%28%3Ffreq%29%0ALIMIT+10">co-cited other authors</a></li><li><a rel="nofollow" href="https://sparql.dblp.org?exec=true&query=%23%23+Non-coauthors+of+Maria+Halkidi+with+many+coauthors+in+common%0APREFIX+dblp%3A+%3Chttps%3A%2F%2Fdblp.org%2Frdf%2Fschema%23%3E%0APREFIX+rdfs%3A+%3Chttp%3A%2F%2Fwww.w3.org%2F2000%2F01%2Frdf-schema%23%3E%0ASELECT+%3Fname+%3Faffiliation+%28COUNT%28DISTINCT+%3Fcoauthor%29+AS+%3Fcount%29+%28%3Fcocoauthor+as+%3Fdblp%29+%28SAMPLE%28%3Forcids%29+as+%3Forcid%29+WHERE+%7B%0A++VALUES+%3Fauthor+%7B+%3Chttps%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919%3E+%7D%0A++%3Fpubl+dblp%3AauthoredBy+%3Fauthor+.%0A++%3Fpubl+dblp%3AauthoredBy+%3Fcoauthor+.%0A++FILTER+%28+%3Fauthor+%21%3D+%3Fcoauthor+%29+.%0A++%3Fcopubl+dblp%3AauthoredBy+%3Fcoauthor+.%0A++%3Fcopubl+dblp%3AauthoredBy+%3Fcocoauthor+.%0A++FILTER+%28+%3Fauthor+%21%3D+%3Fcocoauthor+%29+.%0A++MINUS+%7B+%3Fcocopubl+dblp%3AauthoredBy+%3Fauthor+.+%3Fcocopubl+dblp%3AauthoredBy+%3Fcocoauthor+%7D%0A++%3Fcocoauthor+rdfs%3Alabel+%3Fname+.%0A++OPTIONAL+%7B+%3Fcocoauthor+dblp%3AprimaryAffiliation+%3Faffiliation+.+%7D%0A++OPTIONAL+%7B+%3Fcocoauthor+dblp%3Aorcid+%3Forcids+.+%7D%0A%7D%0AGROUP+BY+%3Fname+%3Faffiliation+%3Fcocoauthor%0AORDER+BY+DESC%28%3Fcount%29%0ALIMIT+10">non-coauthors with many coauthors in common</a></li><li><a rel="nofollow" href="https://sparql.dblp.org?exec=true&query=%23%23+Highly+cited+publications+by+Maria+Halkidi%0APREFIX+dblp%3A+%3Chttps%3A%2F%2Fdblp.org%2Frdf%2Fschema%23%3E%0APREFIX+cito%3A+%3Chttp%3A%2F%2Fpurl.org%2Fspar%2Fcito%2F%3E%0APREFIX+rdfs%3A+%3Chttp%3A%2F%2Fwww.w3.org%2F2000%2F01%2Frdf-schema%23%3E%0ASELECT+%3Flabel+%3Fyear+%28COUNT%28DISTINCT+%3Fcite%29+as+%3Fcites%29+%28%3Fpubl+as+%3Fdblp%29+%28SAMPLE%28%3Fdois%29+as+%3Fdoi%29+WHERE+%7B%0A++VALUES+%3Fauthor+%7B+%3Chttps%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919%3E+%7D%0A++%3Fpubl+dblp%3AauthoredBy+%3Fauthor+.%0A++%3Fpubl+rdfs%3Alabel+%3Flabel+.%0A++%3Fpubl+dblp%3Aomid+%3Fomids+.%0A++OPTIONAL+%7B+%3Fcite+cito%3AhasCitedEntity+%3Fomids+.+%7D%0A++OPTIONAL+%7B+%3Fpubl+dblp%3AyearOfPublication+%3Fyear+.+%7D%0A++OPTIONAL+%7B+%3Fpubl+dblp%3Adoi+%3Fdois+.+%7D%0A%7D%0AGROUP+BY+%3Flabel+%3Fyear+%3Fpubl%0AORDER+BY+DESC%28%3Fcites%29%0ALIMIT+10">highly cited publications</a></li><li><a rel="nofollow" href="https://sparql.dblp.org?exec=true&query=%23%23+Papers+that+cite+Maria+Halkidi+do+also+cite+...%0APREFIX+dblp%3A+%3Chttps%3A%2F%2Fdblp.org%2Frdf%2Fschema%23%3E%0APREFIX+cito%3A+%3Chttp%3A%2F%2Fpurl.org%2Fspar%2Fcito%2F%3E%0APREFIX+rdfs%3A+%3Chttp%3A%2F%2Fwww.w3.org%2F2000%2F01%2Frdf-schema%23%3E%0APREFIX+schema%3A+%3Chttps%3A%2F%2Fschema.org%2F%3E%0ASELECT+%3Flabel+%3Fyear+%28COUNT%28DISTINCT+%3Fother_cite%29+as+%3Ffreq%29+%28%3Fother_publ+as+%3Fdblp%29+%28SAMPLE%28%3Fdois%29+as+%3Fdoi%29+%3Furl+WHERE+%7B%0A++VALUES+%3Fthis_pers+%7B+%3Chttps%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919%3E+%7D+.%0A++%3Fthis_publ+dblp%3AauthoredBy+%3Fthis_pers+.%0A++%3Fthis_publ+dblp%3Aomid+%3Fthis_omid+.%0A++%3Fthis_cite+cito%3AhasCitedEntity+%3Fthis_omid+.%0A++%3Fthis_cite+cito%3AhasCitingEntity+%3Fsource_omid+.%0A++%3Fother_cite+cito%3AhasCitingEntity+%3Fsource_omid+.%0A++%3Fother_cite+cito%3AhasCitedEntity+%3Fother_omid+.%0A++FILTER%28+%3Fother_omid+%21%3D+%3Fthis_omid+%29+.%0A++OPTIONAL+%7B%0A++++%3Fother_publ+dblp%3Aomid+%3Fother_omid+.%0A++++%3Fother_publ+rdfs%3Alabel+%3Flabel+.%0A++++OPTIONAL+%7B+%3Fother_publ+dblp%3AyearOfPublication+%3Fyear+.+%7D%0A++++OPTIONAL+%7B+%3Fother_publ+dblp%3Adoi+%3Fdois+.+%7D%0A++%7D%0A++MINUS+%7B+%3Fother_publ+dblp%3AauthoredBy+%3Fthis_pers+.+%7D%0A++OPTIONAL+%7B+%3Fother_omid+schema%3Aurl+%3Furl+.+%7D%0A%7D%0AGROUP+BY+%3Flabel+%3Fyear+%3Fother_publ+%3Furl%0AORDER+BY+DESC%28%3Ffreq%29%0ALIMIT+10">co-cited publications</a></li><li><a rel="nofollow" href="https://sparql.dblp.org?exec=true&query=%23%23+Who+is+citing+Maria+Halkidi%3F%0APREFIX+dblp%3A+%3Chttps%3A%2F%2Fdblp.org%2Frdf%2Fschema%23%3E%0APREFIX+cito%3A+%3Chttp%3A%2F%2Fpurl.org%2Fspar%2Fcito%2F%3E%0APREFIX+rdfs%3A+%3Chttp%3A%2F%2Fwww.w3.org%2F2000%2F01%2Frdf-schema%23%3E%0ASELECT+%3Fname+%3Faffiliation+%28COUNT%28%3Fother_pers%29+as+%3Ffreq%29+%28%3Fother_pers+as+%3Fdblp%29+%28SAMPLE%28%3Forcids%29+as+%3Forcid%29+WHERE+%7B%0A++VALUES+%3Fthis_pers+%7B+%3Chttps%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919%3E+%7D+.%0A++%3Fthis_publ+dblp%3AauthoredBy+%3Fthis_pers+.%0A++%3Fthis_publ+dblp%3Aomid+%3Fthis_omid+.%0A++%3Fcite+cito%3AhasCitedEntity+%3Fthis_omid+.%0A++%3Fcite+cito%3AhasCitingEntity+%3Fother_omid+.%0A++%3Fother_publ+dblp%3Aomid+%3Fother_omid+.%0A++%3Fother_publ+dblp%3AauthoredBy+%3Fother_pers+.%0A++FILTER%28+%3Fother_pers+%21%3D+%3Fthis_pers+%29%0A++%3Fother_pers+dblp%3AprimaryCreatorName+%3Fname+.%0A++OPTIONAL+%7B+%3Fother_pers+dblp%3AprimaryAffiliation+%3Faffiliation+.+%7D%0A++OPTIONAL+%7B+%3Fother_pers+dblp%3Aorcid+%3Forcids+.+%7D%0A%7D%0AGROUP+BY+%3Fname+%3Faffiliation+%3Fother_pers%0AORDER+BY+DESC%28%3Ffreq%29%0ALIMIT+10">authors citing this author</a></li><li><a rel="nofollow" href="https://sparql.dblp.org?exec=true&query=%23%23+Number-of-authors+statistic+for+Maria+Halkidi%0APREFIX+dblp%3A+%3Chttps%3A%2F%2Fdblp.org%2Frdf%2Fschema%23%3E%0ASELECT+%3Fnumber_of_authors+%28COUNT%28%3Fnumber_of_authors%29+AS+%3Ffreq%29+WHERE+%7B%0A++VALUES+%3Fpers+%7B+%3Chttps%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919%3E+%7D+.%0A++%3Fpubl+dblp%3AauthoredBy+%3Fpers+.%0A++%3Fpubl+dblp%3AnumberOfCreators+%3Fnumber_of_authors+.%0A%7D%0AGROUP+BY+%3Fnumber_of_authors%0AORDER+BY+%3Fnumber_of_authors">number of authors per paper</a></li></ul><p style="margin:4px 0px 0px; padding:0px; font-size:small;"><a rel="nofollow" href="https://sparql.dblp.org?query=SELECT+%2A+WHERE+%7B%0A++VALUES+%3Fpers+%7B+%3Chttps%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919%3E+%7D+.%0A%0A%7D"><em>or build your own?</em></a></p></div></div></div> <div id="authorpage-refine" class="hideable js-only"><header class="hide-head h2"><h2>Refine list</h2> <div id="refine-info" class="drop-down notifier"><div class="head"><img alt="note" src="https://dblp.org/img/note-mark.dark.12x12.png"></div><div class="body"><p><b>refinements active!</b></p><p>zoomed in on <span id="record-count">??</span> of <span id="max-record-count">??</span> records<p><ul id="refine-info-summary"></ul> <p><button id="reset-refinements" class="text"><img alt="" src="https://dblp.org/img/del-mark.12x12.png" class="icon">dismiss all constraints</button></p><p><em>view refined list in</em></p><p><button id="refine-info-cs-link" class="text"><img alt="" src="https://dblp.org/img/dblp.dark.16x16.png" class="icon">dblp search</button></p><p><em>export refined list as</em></p><p><button id="refine-export-xml-link" class="text"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</button></p><p><button id="refine-export-json-link" class="text"><img alt="" src="https://dblp.org/img/json.dark.16x16.png" class="icon">JSON</button></p><p><button id="refine-export-jsonp-link" class="text"><img alt="" src="https://dblp.org/img/json.dark.16x16.png" class="icon">JSONP</button></p><p><button id="refine-export-bibtex-link" class="text"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</button></p></div></div></header><div class="hide-body"><div class="refine-by info"><em><span id="record-info">showing all</span> <span id="max-record-info">??</span> records</em></div></div></div></div> <div id="publ-section" class="section"><div class="hideable"><header id="the2020s" class="hide-head h2"><h2>2020 – today</h2> <div class="drop-down faq"><div class="head"><a href="https://dblp.org/faq/"><img alt="FAQ" src="https://dblp.org/img/faq-mark.dark.12x12.png"></a></div><div class="body"><b>see FAQ</b><ul><li><a href="https://dblp.org/faq/1474790">What is the meaning of the colors in the publication lists?</a></li></ul></div></div></header><div class="hide-body"><ul class="publ-list" data-style="ydvspc"><li class="year">2021</li><li class="entry inproceedings toc" id="conf/ifip12/KoutsopoulosH21" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c25">[c25]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-3-030-79150-6_55"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-3-030-79150-6_55" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-3-030-79150-6_55"><a href="https://unpaywall.org/10.1007%2F978-3-030-79150-6_55"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-3-030-79150-6_55"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-3-030-79150-6_55"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/ifip12/KoutsopoulosH21&rft.au=Iordanis+Koutsopoulos&rft.atitle=Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage.&rft.btitle=AIAI&rft.date=2021&rft.pages=703-714&rft_id=info%3Adoi%2F10.1007%2F978-3-030-79150-6_55&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/ifip12/KoutsopoulosH21</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-3-030-79150-6_55"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-79150-6_55&text=%22Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-79150-6_55&text=%22Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-79150-6_55&title=%22Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-79150-6_55"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-79150-6_55&title=%22Optimization+of+Multi-stakeholder+Recommender+Systems+for+Diversity+and+Coverage.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-79150-6_55"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/ifip12/KoutsopoulosH21">https://dblp.org/rec/conf/ifip12/KoutsopoulosH21</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>:<br> <span class="title" itemprop="name">Optimization of Multi-stakeholder Recommender Systems for Diversity and Coverage.</span> <a href="https://dblp.org/db/conf/ifip12/aiai2021.html#KoutsopoulosH21"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">AIAI</span></span> <span itemprop="datePublished">2021</span></a>: <span itemprop="pagination">703-714</span></cite><meta property="genre" content="computer science"></li><li class="year">2020</li><li class="entry article toc" id="journals/kais/HalkidiK20" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j12">[j12]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/s10115-020-01460-5"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/s10115-020-01460-5" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2FS10115-020-01460-5"><a href="https://unpaywall.org/10.1007%2FS10115-020-01460-5"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/kais/HalkidiK20.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2FS10115-020-01460-5"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2FS10115-020-01460-5"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/kais/HalkidiK20&rft.au=Maria+Halkidi&rft.atitle=Recommender+systems+with+selfish+users.&rft.jtitle=Knowl.+Inf.+Syst.&rft.volume=62&rft.issue=8&rft.date=2020&rft.pages=3239-3262&rft_id=info%3Adoi%2F10.1007%2FS10115-020-01460-5&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/kais/HalkidiK20.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/kais/HalkidiK20.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/kais/HalkidiK20.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/kais/HalkidiK20.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/kais/HalkidiK20.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/kais/HalkidiK20.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/kais/HalkidiK20.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/kais/HalkidiK20</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Recommender+systems+with+selfish+users."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Recommender+systems+with+selfish+users."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Recommender+systems+with+selfish+users."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Recommender+systems+with+selfish+users."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Recommender+systems+with+selfish+users."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Recommender+systems+with+selfish+users."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2FS10115-020-01460-5"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs10115-020-01460-5&text=%22Recommender+systems+with+selfish+users.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs10115-020-01460-5&text=%22Recommender+systems+with+selfish+users.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs10115-020-01460-5&title=%22Recommender+systems+with+selfish+users.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs10115-020-01460-5"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs10115-020-01460-5&title=%22Recommender+systems+with+selfish+users.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2Fs10115-020-01460-5"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/kais/HalkidiK20">https://dblp.org/rec/journals/kais/HalkidiK20</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>:<br> <span class="title" itemprop="name">Recommender systems with selfish users.</span> <a href="https://dblp.org/db/journals/kais/kais62.html#HalkidiK20"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">Knowl. Inf. Syst.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">62</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">8</span></span>)</a>: <span itemprop="pagination">3239-3262</span> (<span itemprop="datePublished">2020</span>)</cite><meta property="genre" content="computer science"></li></ul></div></div><div class="hideable"><header id="the2010s" class="hide-head h2"><h2>2010 – 2019</h2> <div class="drop-down faq"><div class="head"><a href="https://dblp.org/faq/"><img alt="FAQ" src="https://dblp.org/img/faq-mark.dark.12x12.png"></a></div><div class="body"><b>see FAQ</b><ul><li><a href="https://dblp.org/faq/1474790">What is the meaning of the colors in the publication lists?</a></li></ul></div></div></header><div class="hide-body"><ul class="publ-list" data-style="ydvspc"><li class="year">2019</li><li class="entry inproceedings toc" id="conf/ecir/HalkidiK19" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c24">[c24]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-3-030-15719-7_9"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-3-030-15719-7_9" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-3-030-15719-7_9"><a href="https://unpaywall.org/10.1007%2F978-3-030-15719-7_9"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/ecir/HalkidiK19.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-3-030-15719-7_9"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-3-030-15719-7_9"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/ecir/HalkidiK19&rft.au=Maria+Halkidi&rft.atitle=QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering.&rft.btitle=ECIR+%282%29&rft.date=2019&rft.pages=70-77&rft_id=info%3Adoi%2F10.1007%2F978-3-030-15719-7_9&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/ecir/HalkidiK19.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/ecir/HalkidiK19.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ecir/HalkidiK19.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ecir/HalkidiK19.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ecir/HalkidiK19.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ecir/HalkidiK19.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ecir/HalkidiK19.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/ecir/HalkidiK19</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-3-030-15719-7_9"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-15719-7_9&text=%22QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-15719-7_9&text=%22QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-15719-7_9&title=%22QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-15719-7_9"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-15719-7_9&title=%22QGraph%3A+A+Quality+Assessment+Index+for+Graph+Clustering.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-030-15719-7_9"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/ecir/HalkidiK19">https://dblp.org/rec/conf/ecir/HalkidiK19</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>:<br> <span class="title" itemprop="name">QGraph: A Quality Assessment Index for Graph Clustering.</span> <a href="https://dblp.org/db/conf/ecir/ecir2019-2.html#HalkidiK19"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">ECIR (2)</span></span> <span itemprop="datePublished">2019</span></a>: <span itemprop="pagination">70-77</span></cite><meta property="genre" content="computer science"></li><li class="year">2018</li><li class="entry inproceedings toc" id="conf/dasc/KoutsopoulosH18" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c23">[c23]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/DASC/PiCom/DataCom/CyberSciTec.2018.000-9"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/DASC/PiCom/DataCom/CyberSciTec.2018.000-9" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="https://doi.ieeecomputersociety.org/10.1109/DASC/PiCom/DataCom/CyberSciTec.2018.000-9" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FDASC%2FPICOM%2FDATACOM%2FCYBERSCITEC.2018.000-9"><a href="https://unpaywall.org/10.1109%2FDASC%2FPICOM%2FDATACOM%2FCYBERSCITEC.2018.000-9"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FDASC%2FPICOM%2FDATACOM%2FCYBERSCITEC.2018.000-9"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FDASC%2FPICOM%2FDATACOM%2FCYBERSCITEC.2018.000-9"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/dasc/KoutsopoulosH18&rft.au=Iordanis+Koutsopoulos&rft.atitle=Efficient+and+Fair+Item+Coverage+in+Recommender+Systems.&rft.btitle=DASC%2FPiCom%2FDataCom%2FCyberSciTech&rft.date=2018&rft.pages=912-918&rft_id=info%3Adoi%2F10.1109%2FDASC%2FPICOM%2FDATACOM%2FCYBERSCITEC.2018.000-9&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/dasc/KoutsopoulosH18</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Efficient+and+Fair+Item+Coverage+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Efficient+and+Fair+Item+Coverage+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Efficient+and+Fair+Item+Coverage+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Efficient+and+Fair+Item+Coverage+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Efficient+and+Fair+Item+Coverage+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Efficient+and+Fair+Item+Coverage+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FDASC%2FPICOM%2FDATACOM%2FCYBERSCITEC.2018.000-9"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FDASC%2FPiCom%2FDataCom%2FCyberSciTec.2018.000-9&text=%22Efficient+and+Fair+Item+Coverage+in+Recommender+Systems.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FDASC%2FPiCom%2FDataCom%2FCyberSciTec.2018.000-9&text=%22Efficient+and+Fair+Item+Coverage+in+Recommender+Systems.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FDASC%2FPiCom%2FDataCom%2FCyberSciTec.2018.000-9&title=%22Efficient+and+Fair+Item+Coverage+in+Recommender+Systems.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FDASC%2FPiCom%2FDataCom%2FCyberSciTec.2018.000-9"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FDASC%2FPiCom%2FDataCom%2FCyberSciTec.2018.000-9&title=%22Efficient+and+Fair+Item+Coverage+in+Recommender+Systems.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FDASC%2FPiCom%2FDataCom%2FCyberSciTec.2018.000-9"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/dasc/KoutsopoulosH18">https://dblp.org/rec/conf/dasc/KoutsopoulosH18</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>:<br> <span class="title" itemprop="name">Efficient and Fair Item Coverage in Recommender Systems.</span> <a href="https://dblp.org/db/conf/dasc/dasc2018.html#KoutsopoulosH18"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">DASC/PiCom/DataCom/CyberSciTech</span></span> <span itemprop="datePublished">2018</span></a>: <span itemprop="pagination">912-918</span></cite><meta property="genre" content="computer science"></li><li class="entry reference toc" id="reference/db/Halkidi18" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Reference Works" src="https://dblp.org/img/n.png"></div><div class="nr" id="r2">[r2]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-1-4614-8265-9_604"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-1-4614-8265-9_604" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-1-4614-8265-9_604"><a href="https://unpaywall.org/10.1007%2F978-1-4614-8265-9_604"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/reference/db/Halkidi18.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-1-4614-8265-9_604"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-1-4614-8265-9_604"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Areference/db/Halkidi18&rft.au=Maria+Halkidi&rft.atitle=Hierarchical+Clustering.&rft.btitle=Encyclopedia+of+Database+Systems+%282nd+ed.%29&rft.date=2018&rft_id=info%3Adoi%2F10.1007%2F978-1-4614-8265-9_604&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi18.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi18.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi18.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi18.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi18.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi18.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi18.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>reference/db/Halkidi18</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Hierarchical+Clustering."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Hierarchical+Clustering."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Hierarchical+Clustering."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Hierarchical+Clustering."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Hierarchical+Clustering."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Hierarchical+Clustering."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-1-4614-8265-9_604"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4614-8265-9_604&text=%22Hierarchical+Clustering.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4614-8265-9_604&text=%22Hierarchical+Clustering.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4614-8265-9_604&title=%22Hierarchical+Clustering.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4614-8265-9_604"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4614-8265-9_604&title=%22Hierarchical+Clustering.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4614-8265-9_604"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/reference/db/Halkidi18">https://dblp.org/rec/reference/db/Halkidi18</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>:<br> <span class="title" itemprop="name">Hierarchical Clustering.</span> <a href="https://dblp.org/db/reference/db/h2.html#Halkidi18"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">Encyclopedia of Database Systems (2nd ed.)</span></span> <span itemprop="datePublished">2018</span></a></cite><meta property="genre" content="computer science"></li><li class="year">2016</li><li class="entry inproceedings toc" id="conf/icdm/KaranasouADH16" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c22">[c22]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/ICDMW.2016.0138"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/ICDMW.2016.0138" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="https://doi.ieeecomputersociety.org/10.1109/ICDMW.2016.0138" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FICDMW.2016.0138"><a href="https://unpaywall.org/10.1109%2FICDMW.2016.0138"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/icdm/KaranasouADH16.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FICDMW.2016.0138"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FICDMW.2016.0138"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/icdm/KaranasouADH16&rft.au=Maria+Karanasou&rft.atitle=Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data.&rft.btitle=ICDM+Workshops&rft.date=2016&rft.pages=944-951&rft_id=info%3Adoi%2F10.1109%2FICDMW.2016.0138&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KaranasouADH16.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KaranasouADH16.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KaranasouADH16.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KaranasouADH16.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KaranasouADH16.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KaranasouADH16.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KaranasouADH16.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/icdm/KaranasouADH16</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FICDMW.2016.0138"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2016.0138&text=%22Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2016.0138&text=%22Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2016.0138&title=%22Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2016.0138"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2016.0138&title=%22Scalable+and+Real-Time+Sentiment+Analysis+of+Twitter+Data.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2016.0138"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/icdm/KaranasouADH16">https://dblp.org/rec/conf/icdm/KaranasouADH16</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/186/7746.html" itemprop="url"><span itemprop="name" title="Maria Karanasou">Maria Karanasou</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/194/4715.html" itemprop="url"><span itemprop="name" title="Anneta Ampla">Anneta Ampla</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/3086.html" itemprop="url"><span itemprop="name" title="Christos Doulkeridis">Christos Doulkeridis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>:<br> <span class="title" itemprop="name">Scalable and Real-Time Sentiment Analysis of Twitter Data.</span> <a href="https://dblp.org/db/conf/icdm/icdm2016w.html#KaranasouADH16"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">ICDM Workshops</span></span> <span itemprop="datePublished">2016</span></a>: <span itemprop="pagination">944-951</span></cite><meta property="genre" content="computer science"></li><li class="year">2015</li><li class="entry inproceedings toc" id="conf/cikm/VahabiKGH15" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c21">[c21]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/2806416.2806559"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/2806416.2806559" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1145%2F2806416.2806559"><a href="https://unpaywall.org/10.1145%2F2806416.2806559"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/cikm/VahabiKGH15.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1145%2F2806416.2806559"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1145%2F2806416.2806559"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/cikm/VahabiKGH15&rft.au=Hossein+Vahabi&rft.atitle=DifRec%3A+A+Social-Diffusion-Aware+Recommender+System.&rft.btitle=CIKM&rft.date=2015&rft.pages=1481-1490&rft_id=info%3Adoi%2F10.1145%2F2806416.2806559&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/cikm/VahabiKGH15.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/cikm/VahabiKGH15.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/cikm/VahabiKGH15.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/cikm/VahabiKGH15.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/cikm/VahabiKGH15.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/cikm/VahabiKGH15.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/cikm/VahabiKGH15.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/cikm/VahabiKGH15</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=DifRec%3A+A+Social-Diffusion-Aware+Recommender+System."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=DifRec%3A+A+Social-Diffusion-Aware+Recommender+System."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=DifRec%3A+A+Social-Diffusion-Aware+Recommender+System."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=DifRec%3A+A+Social-Diffusion-Aware+Recommender+System."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=DifRec%3A+A+Social-Diffusion-Aware+Recommender+System."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=DifRec%3A+A+Social-Diffusion-Aware+Recommender+System."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1145%2F2806416.2806559"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F2806416.2806559&text=%22DifRec%3A+A+Social-Diffusion-Aware+Recommender+System.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F2806416.2806559&text=%22DifRec%3A+A+Social-Diffusion-Aware+Recommender+System.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F2806416.2806559&title=%22DifRec%3A+A+Social-Diffusion-Aware+Recommender+System.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F2806416.2806559"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F2806416.2806559&title=%22DifRec%3A+A+Social-Diffusion-Aware+Recommender+System.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F2806416.2806559"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/cikm/VahabiKGH15">https://dblp.org/rec/conf/cikm/VahabiKGH15</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/10/8612.html" itemprop="url"><span itemprop="name" title="Hossein Vahabi">Hossein Vahabi</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0009-0006-0396-6742"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/63/3664.html" itemprop="url"><span itemprop="name" title="Francesco Gullo">Francesco Gullo</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-7052-1114"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>:<br> <span class="title" itemprop="name">DifRec: A Social-Diffusion-Aware Recommender System.</span> <a href="https://dblp.org/db/conf/cikm/cikm2015.html#VahabiKGH15"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">CIKM</span></span> <span itemprop="datePublished">2015</span></a>: <span itemprop="pagination">1481-1490</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/icdm/KoutsopoulosGH15" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c20">[c20]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/ICDMW.2015.175"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/ICDMW.2015.175" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="https://doi.ieeecomputersociety.org/10.1109/ICDMW.2015.175" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FICDMW.2015.175"><a href="https://unpaywall.org/10.1109%2FICDMW.2015.175"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FICDMW.2015.175"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FICDMW.2015.175"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/icdm/KoutsopoulosGH15&rft.au=Iordanis+Koutsopoulos&rft.atitle=Auctioning+Data+for+Learning.&rft.btitle=ICDM+Workshops&rft.date=2015&rft.pages=706-713&rft_id=info%3Adoi%2F10.1109%2FICDMW.2015.175&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/icdm/KoutsopoulosGH15</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Auctioning+Data+for+Learning."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Auctioning+Data+for+Learning."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Auctioning+Data+for+Learning."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Auctioning+Data+for+Learning."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Auctioning+Data+for+Learning."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Auctioning+Data+for+Learning."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FICDMW.2015.175"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2015.175&text=%22Auctioning+Data+for+Learning.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2015.175&text=%22Auctioning+Data+for+Learning.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2015.175&title=%22Auctioning+Data+for+Learning.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2015.175"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2015.175&title=%22Auctioning+Data+for+Learning.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FICDMW.2015.175"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/icdm/KoutsopoulosGH15">https://dblp.org/rec/conf/icdm/KoutsopoulosGH15</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/g/AristidesGionis.html" itemprop="url"><span itemprop="name" title="Aristides Gionis">Aristides Gionis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>:<br> <span class="title" itemprop="name">Auctioning Data for Learning.</span> <a href="https://dblp.org/db/conf/icdm/icdm2015w.html#KoutsopoulosGH15"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">ICDM Workshops</span></span> <span itemprop="datePublished">2015</span></a>: <span itemprop="pagination">706-713</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/semeval/KaranasouDH15" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c19">[c19]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.18653/v1/s15-2120"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.18653/v1/s15-2120" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon">electronic edition via DOI (open access)</a></li><li class="ee"><a href="https://aclanthology.org/S15-2120/" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon">electronic edition @ aclanthology.org (open access)</a></li><li class="details"><a href="https://dblp.org/rec/conf/semeval/KaranasouDH15.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.18653%2FV1%2FS15-2120"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.18653%2FV1%2FS15-2120"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/semeval/KaranasouDH15&rft.au=Maria+Karanasou&rft.atitle=DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter.&rft.btitle=SemEval%40NAACL-HLT&rft.date=2015&rft.pages=709-713&rft_id=info%3Adoi%2F10.18653%2FV1%2FS15-2120&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/semeval/KaranasouDH15.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/semeval/KaranasouDH15.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/semeval/KaranasouDH15.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/semeval/KaranasouDH15.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/semeval/KaranasouDH15.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/semeval/KaranasouDH15.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/semeval/KaranasouDH15.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/semeval/KaranasouDH15</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.18653%2FV1%2FS15-2120"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.18653%2Fv1%2Fs15-2120&text=%22DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.18653%2Fv1%2Fs15-2120&text=%22DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.18653%2Fv1%2Fs15-2120&title=%22DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.18653%2Fv1%2Fs15-2120"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.18653%2Fv1%2Fs15-2120&title=%22DsUniPi%3A+An+SVM-based+Approach+for+Sentiment+Analysis+of+Figurative+Language+on+Twitter.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.18653%2Fv1%2Fs15-2120"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/semeval/KaranasouDH15">https://dblp.org/rec/conf/semeval/KaranasouDH15</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/186/7746.html" itemprop="url"><span itemprop="name" title="Maria Karanasou">Maria Karanasou</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/3086.html" itemprop="url"><span itemprop="name" title="Christos Doulkeridis">Christos Doulkeridis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>:<br> <span class="title" itemprop="name">DsUniPi: An SVM-based Approach for Sentiment Analysis of Figurative Language on Twitter.</span> <a href="https://dblp.org/db/conf/semeval/semeval2015.html#KaranasouDH15"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">SemEval@NAACL-HLT</span></span> <span itemprop="datePublished">2015</span></a>: <span itemprop="pagination">709-713</span></cite><meta property="genre" content="computer science"></li><li class="year">2014</li><li class="entry article toc" id="journals/comcom/KoutsopoulosH14" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j11">[j11]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1016/j.comcom.2014.03.012"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1016/j.comcom.2014.03.012" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1016%2FJ.COMCOM.2014.03.012"><a href="https://unpaywall.org/10.1016%2FJ.COMCOM.2014.03.012"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1016%2FJ.COMCOM.2014.03.012"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1016%2FJ.COMCOM.2014.03.012"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/comcom/KoutsopoulosH14&rft.au=Iordanis+Koutsopoulos&rft.atitle=Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks.&rft.jtitle=Comput.+Commun.&rft.volume=45&rft.date=2014&rft.pages=47-58&rft_id=info%3Adoi%2F10.1016%2FJ.COMCOM.2014.03.012&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/comcom/KoutsopoulosH14</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1016%2FJ.COMCOM.2014.03.012"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.comcom.2014.03.012&text=%22Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.comcom.2014.03.012&text=%22Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.comcom.2014.03.012&title=%22Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.comcom.2014.03.012"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.comcom.2014.03.012&title=%22Distributed+energy-efficient+estimation+in+spatially+correlated+wireless+sensor+networks.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.comcom.2014.03.012"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/comcom/KoutsopoulosH14">https://dblp.org/rec/journals/comcom/KoutsopoulosH14</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>:<br> <span class="title" itemprop="name">Distributed energy-efficient estimation in spatially correlated wireless sensor networks.</span> <a href="https://dblp.org/db/journals/comcom/comcom45.html#KoutsopoulosH14"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">Comput. Commun.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">45</span></span></a>: <span itemprop="pagination">47-58</span> (<span itemprop="datePublished">2014</span>)</cite><meta property="genre" content="computer science"></li><li class="year">2012</li><li class="entry inproceedings toc" id="conf/pakdd/HalkidiSP12" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c18">[c18]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-3-642-30217-6_48"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-3-642-30217-6_48" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-3-642-30217-6_48"><a href="https://unpaywall.org/10.1007%2F978-3-642-30217-6_48"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/pakdd/HalkidiSP12.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-3-642-30217-6_48"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-3-642-30217-6_48"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/pakdd/HalkidiSP12&rft.au=Maria+Halkidi&rft.atitle=A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data.&rft.btitle=PAKDD+%281%29&rft.date=2012&rft.pages=578-590&rft_id=info%3Adoi%2F10.1007%2F978-3-642-30217-6_48&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/pakdd/HalkidiSP12.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/pakdd/HalkidiSP12.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pakdd/HalkidiSP12.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pakdd/HalkidiSP12.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pakdd/HalkidiSP12.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pakdd/HalkidiSP12.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pakdd/HalkidiSP12.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/pakdd/HalkidiSP12</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-3-642-30217-6_48"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-30217-6_48&text=%22A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-30217-6_48&text=%22A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-30217-6_48&title=%22A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-30217-6_48"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-30217-6_48&title=%22A+Semi-supervised+Incremental+Clustering+Algorithm+for+Streaming+Data.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-30217-6_48"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/pakdd/HalkidiSP12">https://dblp.org/rec/conf/pakdd/HalkidiSP12</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/s/MyraSpiliopoulou.html" itemprop="url"><span itemprop="name" title="Myra Spiliopoulou">Myra Spiliopoulou</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/63/11335.html" itemprop="url"><span itemprop="name" title="Aikaterini Pavlou">Aikaterini Pavlou</span></a></span>:<br> <span class="title" itemprop="name">A Semi-supervised Incremental Clustering Algorithm for Streaming Data.</span> <a href="https://dblp.org/db/conf/pakdd/pakdd2012-1.html#HalkidiSP12"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">PAKDD (1)</span></span> <span itemprop="datePublished">2012</span></a>: <span itemprop="pagination">578-590</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/ssdbm/VlachouDH12" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c17">[c17]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-3-642-31235-9_9"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-3-642-31235-9_9" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-3-642-31235-9_9"><a href="https://unpaywall.org/10.1007%2F978-3-642-31235-9_9"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/ssdbm/VlachouDH12.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-3-642-31235-9_9"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-3-642-31235-9_9"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/ssdbm/VlachouDH12&rft.au=Akrivi+Vlachou&rft.atitle=Discovering+Representative+Skyline+Points+over+Distributed+Data.&rft.btitle=SSDBM&rft.date=2012&rft.pages=141-158&rft_id=info%3Adoi%2F10.1007%2F978-3-642-31235-9_9&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/VlachouDH12.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/VlachouDH12.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/VlachouDH12.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/VlachouDH12.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/VlachouDH12.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/VlachouDH12.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/VlachouDH12.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/ssdbm/VlachouDH12</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Discovering+Representative+Skyline+Points+over+Distributed+Data."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Discovering+Representative+Skyline+Points+over+Distributed+Data."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Discovering+Representative+Skyline+Points+over+Distributed+Data."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Discovering+Representative+Skyline+Points+over+Distributed+Data."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Discovering+Representative+Skyline+Points+over+Distributed+Data."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Discovering+Representative+Skyline+Points+over+Distributed+Data."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-3-642-31235-9_9"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-31235-9_9&text=%22Discovering+Representative+Skyline+Points+over+Distributed+Data.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-31235-9_9&text=%22Discovering+Representative+Skyline+Points+over+Distributed+Data.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-31235-9_9&title=%22Discovering+Representative+Skyline+Points+over+Distributed+Data.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-31235-9_9"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-31235-9_9&title=%22Discovering+Representative+Skyline+Points+over+Distributed+Data.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-31235-9_9"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/ssdbm/VlachouDH12">https://dblp.org/rec/conf/ssdbm/VlachouDH12</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/15/6276.html" itemprop="url"><span itemprop="name" title="Akrivi Vlachou">Akrivi Vlachou</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/3086.html" itemprop="url"><span itemprop="name" title="Christos Doulkeridis">Christos Doulkeridis</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-3219-0510"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>:<br> <span class="title" itemprop="name">Discovering Representative Skyline Points over Distributed Data.</span> <a href="https://dblp.org/db/conf/ssdbm/ssdbm2012.html#VlachouDH12"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">SSDBM</span></span> <span itemprop="datePublished">2012</span></a>: <span itemprop="pagination">141-158</span></cite><meta property="genre" content="computer science"></li><li class="year">2011</li><li class="entry article toc" id="journals/ida/HalkidiSTV11" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j10">[j10]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.3233/IDA-2010-0475"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.3233/IDA-2010-0475" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.3233%2FIDA-2010-0475"><a href="https://unpaywall.org/10.3233%2FIDA-2010-0475"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/ida/HalkidiSTV11.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.3233%2FIDA-2010-0475"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.3233%2FIDA-2010-0475"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a><a href="https://www.wikidata.org/entity/Q58219928" itemprop="sameAs"><img alt="Wikidata" src="https://dblp.org/img/wikidata.dark.16x16.png" class="icon" title="Wikidata"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/ida/HalkidiSTV11&rft.au=Maria+Halkidi&rft.atitle=Data+mining+in+software+engineering.&rft.jtitle=Intell.+Data+Anal.&rft.volume=15&rft.issue=3&rft.date=2011&rft.pages=413-441&rft_id=info%3Adoi%2F10.3233%2FIDA-2010-0475&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiSTV11.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiSTV11.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiSTV11.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiSTV11.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiSTV11.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiSTV11.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiSTV11.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/ida/HalkidiSTV11</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Data+mining+in+software+engineering."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Data+mining+in+software+engineering."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Data+mining+in+software+engineering."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Data+mining+in+software+engineering."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Data+mining+in+software+engineering."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Data+mining+in+software+engineering."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.3233%2FIDA-2010-0475"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.3233%2FIDA-2010-0475&text=%22Data+mining+in+software+engineering.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.3233%2FIDA-2010-0475&text=%22Data+mining+in+software+engineering.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.3233%2FIDA-2010-0475&title=%22Data+mining+in+software+engineering.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.3233%2FIDA-2010-0475"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.3233%2FIDA-2010-0475&title=%22Data+mining+in+software+engineering.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.3233%2FIDA-2010-0475"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/ida/HalkidiSTV11">https://dblp.org/rec/journals/ida/HalkidiSTV11</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/s/DiomidisSpinellis.html" itemprop="url"><span itemprop="name" title="Diomidis Spinellis">Diomidis Spinellis</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0003-4231-1897"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/2922.html" itemprop="url"><span itemprop="name" title="George Tsatsaronis 0001">George Tsatsaronis</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0003-2116-2933"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">Data mining in software engineering.</span> <a href="https://dblp.org/db/journals/ida/ida15.html#HalkidiSTV11"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">Intell. Data Anal.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">15</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">3</span></span>)</a>: <span itemprop="pagination">413-441</span> (<span itemprop="datePublished">2011</span>)</cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/mdm/HalkidiK11" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c16">[c16]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/MDM.2011.63"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/MDM.2011.63" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="https://doi.ieeecomputersociety.org/10.1109/MDM.2011.63" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FMDM.2011.63"><a href="https://unpaywall.org/10.1109%2FMDM.2011.63"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/mdm/HalkidiK11.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FMDM.2011.63"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FMDM.2011.63"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/mdm/HalkidiK11&rft.au=Maria+Halkidi&rft.atitle=Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques.&rft.btitle=Mobile+Data+Management+%281%29&rft.date=2011&rft.pages=216-225&rft_id=info%3Adoi%2F10.1109%2FMDM.2011.63&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiK11.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiK11.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiK11.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiK11.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiK11.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiK11.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiK11.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/mdm/HalkidiK11</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FMDM.2011.63"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2011.63&text=%22Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2011.63&text=%22Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2011.63&title=%22Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2011.63"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2011.63&title=%22Online+Clustering+of+Distributed+Streaming+Data+Using+Belief+Propagation+Techniques.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2011.63"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/mdm/HalkidiK11">https://dblp.org/rec/conf/mdm/HalkidiK11</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>:<br> <span class="title" itemprop="name">Online Clustering of Distributed Streaming Data Using Belief Propagation Techniques.</span> <a href="https://dblp.org/db/conf/mdm/mdm2011-1.html#HalkidiK11"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">Mobile Data Management (1)</span></span> <span itemprop="datePublished">2011</span></a>: <span itemprop="pagination">216-225</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/pkdd/HalkidiK11" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c15">[c15]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-3-642-23780-5_50"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-3-642-23780-5_50" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-3-642-23780-5_50"><a href="https://unpaywall.org/10.1007%2F978-3-642-23780-5_50"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/pkdd/HalkidiK11.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-3-642-23780-5_50"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-3-642-23780-5_50"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/pkdd/HalkidiK11&rft.au=Maria+Halkidi&rft.atitle=A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems.&rft.btitle=ECML%2FPKDD+%281%29&rft.date=2011&rft.pages=629-644&rft_id=info%3Adoi%2F10.1007%2F978-3-642-23780-5_50&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiK11.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiK11.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiK11.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiK11.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiK11.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiK11.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiK11.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/pkdd/HalkidiK11</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-3-642-23780-5_50"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-23780-5_50&text=%22A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-23780-5_50&text=%22A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-23780-5_50&title=%22A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-23780-5_50"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-23780-5_50&title=%22A+Game+Theoretic+Framework+for+Data+Privacy+Preservation+in+Recommender+Systems.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-642-23780-5_50"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/pkdd/HalkidiK11">https://dblp.org/rec/conf/pkdd/HalkidiK11</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>:<br> <span class="title" itemprop="name">A Game Theoretic Framework for Data Privacy Preservation in Recommender Systems.</span> <a href="https://dblp.org/db/conf/pkdd/pkdd2011-1.html#HalkidiK11"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">ECML/PKDD (1)</span></span> <span itemprop="datePublished">2011</span></a>: <span itemprop="pagination">629-644</span></cite><meta property="genre" content="computer science"></li><li class="year">2010</li><li class="entry inproceedings toc" id="conf/wiopt/KoutsopoulosH10" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c14">[c14]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://ieeexplore.ieee.org/document/5518812/"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://ieeexplore.ieee.org/document/5518812/" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieee.org</a></li><li class="details"><a href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10.html"><img alt="" src="https://dblp.org/img/info.dark.hollow.16x16.png" class="icon">details & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/wiopt/KoutsopoulosH10&rft.au=Iordanis+Koutsopoulos&rft.atitle=Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks.&rft.btitle=WiOpt&rft.date=2010&rft.pages=1-10&rft_id=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F5518812%2F&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/wiopt/KoutsopoulosH10</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=title%3A%28Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks.%29"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F5518812%2F&text=%22Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F5518812%2F&text=%22Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F5518812%2F&title=%22Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F5518812%2F"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F5518812%2F&title=%22Measurement+aggregation+and+routing+techniques+for+energy-efficient+estimation+in+wireless+sensor+networks.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F5518812%2F"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/wiopt/KoutsopoulosH10">https://dblp.org/rec/conf/wiopt/KoutsopoulosH10</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>:<br> <span class="title" itemprop="name">Measurement aggregation and routing techniques for energy-efficient estimation in wireless sensor networks.</span> <a href="https://dblp.org/db/conf/wiopt/wiopt2010.html#KoutsopoulosH10"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">WiOpt</span></span> <span itemprop="datePublished">2010</span></a>: <span itemprop="pagination">1-10</span></cite><meta property="genre" content="computer science"></li><li class="entry incollection toc" id="reference/dmkdh/HalkidiV10" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Parts in Books or Collections" src="https://dblp.org/img/n.png"></div><div class="nr" id="p2">[p2]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-0-387-09823-4_31"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-0-387-09823-4_31" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-0-387-09823-4_31"><a href="https://unpaywall.org/10.1007%2F978-0-387-09823-4_31"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/reference/dmkdh/HalkidiV10.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-0-387-09823-4_31"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-0-387-09823-4_31"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Areference/dmkdh/HalkidiV10&rft.au=Maria+Halkidi&rft.atitle=Quality+Assessment+Approaches+in+Data+Mining.&rft.btitle=Data+Mining+and+Knowledge+Discovery+Handbook&rft.date=2010&rft.pages=613-639&rft_id=info%3Adoi%2F10.1007%2F978-0-387-09823-4_31&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/reference/dmkdh/HalkidiV10.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/reference/dmkdh/HalkidiV10.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/dmkdh/HalkidiV10.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/dmkdh/HalkidiV10.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/dmkdh/HalkidiV10.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/dmkdh/HalkidiV10.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/dmkdh/HalkidiV10.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>reference/dmkdh/HalkidiV10</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-0-387-09823-4_31"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-09823-4_31&text=%22Quality+Assessment+Approaches+in+Data+Mining.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-09823-4_31&text=%22Quality+Assessment+Approaches+in+Data+Mining.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-09823-4_31&title=%22Quality+Assessment+Approaches+in+Data+Mining.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-09823-4_31"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-09823-4_31&title=%22Quality+Assessment+Approaches+in+Data+Mining.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-09823-4_31"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/reference/dmkdh/HalkidiV10">https://dblp.org/rec/reference/dmkdh/HalkidiV10</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">Quality Assessment Approaches in Data Mining.</span> <a href="https://dblp.org/db/reference/dmkdh/dmkdh2010.html#HalkidiV10"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">Data Mining and Knowledge Discovery Handbook</span></span> <span itemprop="datePublished">2010</span></a>: <span itemprop="pagination">613-639</span></cite><meta property="genre" content="computer science"></li></ul></div></div><div class="hideable"><header id="the2000s" class="hide-head h2"><h2>2000 – 2009</h2> <div class="drop-down faq"><div class="head"><a href="https://dblp.org/faq/"><img alt="FAQ" src="https://dblp.org/img/faq-mark.dark.12x12.png"></a></div><div class="body"><b>see FAQ</b><ul><li><a href="https://dblp.org/faq/1474790">What is the meaning of the colors in the publication lists?</a></li></ul></div></div></header><div class="hide-body"><ul class="publ-list" data-style="ydvspc"><li class="year">2009</li><li class="entry inproceedings toc" id="conf/globecom/KoutsopoulosH09" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c13">[c13]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/GLOCOM.2009.5425294"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/GLOCOM.2009.5425294" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1109%2FGLOCOM.2009.5425294"><a href="https://unpaywall.org/10.1109%2FGLOCOM.2009.5425294"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FGLOCOM.2009.5425294"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FGLOCOM.2009.5425294"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/globecom/KoutsopoulosH09&rft.au=Iordanis+Koutsopoulos&rft.atitle=Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission.&rft.btitle=GLOBECOM&rft.date=2009&rft.pages=1-6&rft_id=info%3Adoi%2F10.1109%2FGLOCOM.2009.5425294&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/globecom/KoutsopoulosH09</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FGLOCOM.2009.5425294"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FGLOCOM.2009.5425294&text=%22Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FGLOCOM.2009.5425294&text=%22Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FGLOCOM.2009.5425294&title=%22Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FGLOCOM.2009.5425294"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FGLOCOM.2009.5425294&title=%22Lifetime+Maximization+in+Wireless+Sensor+Networks+with+an+Estimation+Mission.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FGLOCOM.2009.5425294"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/globecom/KoutsopoulosH09">https://dblp.org/rec/conf/globecom/KoutsopoulosH09</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/03/1746.html" itemprop="url"><span itemprop="name" title="Iordanis Koutsopoulos">Iordanis Koutsopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>:<br> <span class="title" itemprop="name">Lifetime Maximization in Wireless Sensor Networks with an Estimation Mission.</span> <a href="https://dblp.org/db/conf/globecom/globecom2009.html#KoutsopoulosH09"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">GLOBECOM</span></span> <span itemprop="datePublished">2009</span></a>: <span itemprop="pagination">1-6</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/ifip12/TsatsaronisHG09" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c12">[c12]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://ceur-ws.org/Vol-475/AISEW2009/19-pp-179-188-202.pdf"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://ceur-ws.org/Vol-475/AISEW2009/19-pp-179-188-202.pdf" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon">electronic edition @ ceur-ws.org (open access)</a></li><li class="details"><a href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09.html"><img alt="" src="https://dblp.org/img/info.dark.hollow.16x16.png" class="icon">details & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/ifip12/TsatsaronisHG09&rft.au=George+Tsatsaronis&rft.atitle=Quality+Classifiers+for+Open+Source+Software+Repositories.&rft.btitle=AIAI+Workshops&rft.date=2009&rft.pages=179-188&rft_id=https%3A%2F%2Fceur-ws.org%2FVol-475%2FAISEW2009%2F19-pp-179-188-202.pdf&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/ifip12/TsatsaronisHG09</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Quality+Classifiers+for+Open+Source+Software+Repositories."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Quality+Classifiers+for+Open+Source+Software+Repositories."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Quality+Classifiers+for+Open+Source+Software+Repositories."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Quality+Classifiers+for+Open+Source+Software+Repositories."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Quality+Classifiers+for+Open+Source+Software+Repositories."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Quality+Classifiers+for+Open+Source+Software+Repositories."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=title%3A%28Quality+Classifiers+for+Open+Source+Software+Repositories.%29"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fceur-ws.org%2FVol-475%2FAISEW2009%2F19-pp-179-188-202.pdf&text=%22Quality+Classifiers+for+Open+Source+Software+Repositories.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fceur-ws.org%2FVol-475%2FAISEW2009%2F19-pp-179-188-202.pdf&text=%22Quality+Classifiers+for+Open+Source+Software+Repositories.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fceur-ws.org%2FVol-475%2FAISEW2009%2F19-pp-179-188-202.pdf&title=%22Quality+Classifiers+for+Open+Source+Software+Repositories.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fceur-ws.org%2FVol-475%2FAISEW2009%2F19-pp-179-188-202.pdf"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fceur-ws.org%2FVol-475%2FAISEW2009%2F19-pp-179-188-202.pdf&title=%22Quality+Classifiers+for+Open+Source+Software+Repositories.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fceur-ws.org%2FVol-475%2FAISEW2009%2F19-pp-179-188-202.pdf"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/ifip12/TsatsaronisHG09">https://dblp.org/rec/conf/ifip12/TsatsaronisHG09</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/2922.html" itemprop="url"><span itemprop="name" title="George Tsatsaronis 0001">George Tsatsaronis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/27/176.html" itemprop="url"><span itemprop="name" title="Emmanouel A. Giakoumakis">Emmanouel A. Giakoumakis</span></a></span>:<br> <span class="title" itemprop="name">Quality Classifiers for Open Source Software Repositories.</span> <a href="https://dblp.org/db/conf/ifip12/aiai2009w.html#TsatsaronisHG09"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">AIAI Workshops</span></span> <span itemprop="datePublished">2009</span></a>: <span itemprop="pagination">179-188</span></cite><meta property="genre" content="computer science"></li><li class="entry reference toc" id="reference/db/Halkidi09" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Reference Works" src="https://dblp.org/img/n.png"></div><div class="nr" id="r1">[r1]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-0-387-39940-9_604"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-0-387-39940-9_604" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-0-387-39940-9_604"><a href="https://unpaywall.org/10.1007%2F978-0-387-39940-9_604"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/reference/db/Halkidi09.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-0-387-39940-9_604"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-0-387-39940-9_604"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Areference/db/Halkidi09&rft.au=Maria+Halkidi&rft.atitle=Hierarchial+Clustering.&rft.btitle=Encyclopedia+of+Database+Systems&rft.date=2009&rft.pages=1291-1294&rft_id=info%3Adoi%2F10.1007%2F978-0-387-39940-9_604&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi09.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi09.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi09.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi09.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi09.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi09.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/reference/db/Halkidi09.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>reference/db/Halkidi09</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Hierarchial+Clustering."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Hierarchial+Clustering."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Hierarchial+Clustering."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Hierarchial+Clustering."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Hierarchial+Clustering."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Hierarchial+Clustering."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-0-387-39940-9_604"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-39940-9_604&text=%22Hierarchial+Clustering.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-39940-9_604&text=%22Hierarchial+Clustering.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-39940-9_604&title=%22Hierarchial+Clustering.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-39940-9_604"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-39940-9_604&title=%22Hierarchial+Clustering.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-0-387-39940-9_604"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/reference/db/Halkidi09">https://dblp.org/rec/reference/db/Halkidi09</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>:<br> <span class="title" itemprop="name">Hierarchial Clustering.</span> <a href="https://dblp.org/db/reference/db/h.html#Halkidi09"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">Encyclopedia of Database Systems</span></span> <span itemprop="datePublished">2009</span></a>: <span itemprop="pagination">1291-1294</span></cite><meta property="genre" content="computer science"></li><li class="entry informal toc" id="journals/corr/abs-0904-4708" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Informal and Other Publications" src="https://dblp.org/img/n.png"></div><div class="nr" id="i1">[i1]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="http://arxiv.org/abs/0904.4708"><img alt="" src="https://dblp.org/img/paper-oa.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="http://arxiv.org/abs/0904.4708" itemprop="url"><img alt="" src="https://dblp.org/img/paper-oa.dark.16x16.png" class="icon">electronic edition @ arxiv.org (open access)</a></li><li class="details"><a href="https://dblp.org/rec/journals/corr/abs-0904-4708.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/corr/abs-0904-4708&rft.au=George+Tsatsaronis&rft.atitle=Quality+Classifiers+for+Open+Source+Software+Repositories&rft.jtitle=CoRR&rft.volume=abs%2F0904.4708&rft.date=2009&rft_id=http%3A%2F%2Farxiv.org%2Fabs%2F0904.4708&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/corr/abs-0904-4708.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/corr/abs-0904-4708.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/corr/abs-0904-4708.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/corr/abs-0904-4708.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/corr/abs-0904-4708.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/corr/abs-0904-4708.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/corr/abs-0904-4708.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/corr/abs-0904-4708</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Quality+Classifiers+for+Open+Source+Software+Repositories"><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Quality+Classifiers+for+Open+Source+Software+Repositories"><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Quality+Classifiers+for+Open+Source+Software+Repositories"><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Quality+Classifiers+for+Open+Source+Software+Repositories"><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Quality+Classifiers+for+Open+Source+Software+Repositories"><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Quality+Classifiers+for+Open+Source+Software+Repositories"><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=arxiv%3A0904.4708"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=http%3A%2F%2Farxiv.org%2Fabs%2F0904.4708&text=%22Quality+Classifiers+for+Open+Source+Software+Repositories%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=http%3A%2F%2Farxiv.org%2Fabs%2F0904.4708&text=%22Quality+Classifiers+for+Open+Source+Software+Repositories%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=http%3A%2F%2Farxiv.org%2Fabs%2F0904.4708&title=%22Quality+Classifiers+for+Open+Source+Software+Repositories%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=http%3A%2F%2Farxiv.org%2Fabs%2F0904.4708"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=http%3A%2F%2Farxiv.org%2Fabs%2F0904.4708&title=%22Quality+Classifiers+for+Open+Source+Software+Repositories%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=http%3A%2F%2Farxiv.org%2Fabs%2F0904.4708"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/corr/abs-0904-4708">https://dblp.org/rec/journals/corr/abs-0904-4708</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/2922.html" itemprop="url"><span itemprop="name" title="George Tsatsaronis 0001">George Tsatsaronis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/27/176.html" itemprop="url"><span itemprop="name" title="Emmanouel A. Giakoumakis">Emmanouel A. Giakoumakis</span></a></span>:<br> <span class="title" itemprop="name">Quality Classifiers for Open Source Software Repositories.</span> <a href="https://dblp.org/db/journals/corr/corr0904.html#abs-0904-4708"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">CoRR</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">abs/0904.4708</span></span></a> (<span itemprop="datePublished">2009</span>)</cite><meta property="genre" content="computer science"></li><li class="year">2008</li><li class="entry article toc" id="journals/ida/HalkidiV08" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j9">[j9]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="http://content.iospress.com/articles/intelligent-data-analysis/ida00349"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="http://content.iospress.com/articles/intelligent-data-analysis/ida00349" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ iospress.com</a></li><li class="details"><a href="https://dblp.org/rec/journals/ida/HalkidiV08.html"><img alt="" src="https://dblp.org/img/info.dark.hollow.16x16.png" class="icon">details & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/ida/HalkidiV08&rft.au=Maria+Halkidi&rft.atitle=NPClu%3A+An+approach+for+clustering+spatially+extended+objects.&rft.jtitle=Intell.+Data+Anal.&rft.volume=12&rft.issue=6&rft.date=2008&rft.pages=587-606&rft_id=http%3A%2F%2Fcontent.iospress.com%2Farticles%2Fintelligent-data-analysis%2Fida00349&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiV08.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiV08.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiV08.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiV08.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiV08.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiV08.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ida/HalkidiV08.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/ida/HalkidiV08</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=NPClu%3A+An+approach+for+clustering+spatially+extended+objects."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=NPClu%3A+An+approach+for+clustering+spatially+extended+objects."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=NPClu%3A+An+approach+for+clustering+spatially+extended+objects."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=NPClu%3A+An+approach+for+clustering+spatially+extended+objects."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=NPClu%3A+An+approach+for+clustering+spatially+extended+objects."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=NPClu%3A+An+approach+for+clustering+spatially+extended+objects."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=title%3A%28NPClu%3A+An+approach+for+clustering+spatially+extended+objects.%29"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=http%3A%2F%2Fcontent.iospress.com%2Farticles%2Fintelligent-data-analysis%2Fida00349&text=%22NPClu%3A+An+approach+for+clustering+spatially+extended+objects.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=http%3A%2F%2Fcontent.iospress.com%2Farticles%2Fintelligent-data-analysis%2Fida00349&text=%22NPClu%3A+An+approach+for+clustering+spatially+extended+objects.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=http%3A%2F%2Fcontent.iospress.com%2Farticles%2Fintelligent-data-analysis%2Fida00349&title=%22NPClu%3A+An+approach+for+clustering+spatially+extended+objects.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=http%3A%2F%2Fcontent.iospress.com%2Farticles%2Fintelligent-data-analysis%2Fida00349"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=http%3A%2F%2Fcontent.iospress.com%2Farticles%2Fintelligent-data-analysis%2Fida00349&title=%22NPClu%3A+An+approach+for+clustering+spatially+extended+objects.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=http%3A%2F%2Fcontent.iospress.com%2Farticles%2Fintelligent-data-analysis%2Fida00349"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/ida/HalkidiV08">https://dblp.org/rec/journals/ida/HalkidiV08</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">NPClu: An approach for clustering spatially extended objects.</span> <a href="https://dblp.org/db/journals/ida/ida12.html#HalkidiV08"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">Intell. Data Anal.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">12</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">6</span></span>)</a>: <span itemprop="pagination">587-606</span> (<span itemprop="datePublished">2008</span>)</cite><meta property="genre" content="computer science"></li><li class="entry article toc" id="journals/prl/HalkidiV08" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j8">[j8]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1016/j.patrec.2007.12.011"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1016/j.patrec.2007.12.011" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1016%2FJ.PATREC.2007.12.011"><a href="https://unpaywall.org/10.1016%2FJ.PATREC.2007.12.011"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/prl/HalkidiV08.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1016%2FJ.PATREC.2007.12.011"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1016%2FJ.PATREC.2007.12.011"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/prl/HalkidiV08&rft.au=Maria+Halkidi&rft.atitle=A+density-based+cluster+validity+approach+using+multi-representatives.&rft.jtitle=Pattern+Recognit.+Lett.&rft.volume=29&rft.issue=6&rft.date=2008&rft.pages=773-786&rft_id=info%3Adoi%2F10.1016%2FJ.PATREC.2007.12.011&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/prl/HalkidiV08.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/prl/HalkidiV08.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/prl/HalkidiV08.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/prl/HalkidiV08.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/prl/HalkidiV08.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/prl/HalkidiV08.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/prl/HalkidiV08.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/prl/HalkidiV08</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+density-based+cluster+validity+approach+using+multi-representatives."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+density-based+cluster+validity+approach+using+multi-representatives."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+density-based+cluster+validity+approach+using+multi-representatives."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+density-based+cluster+validity+approach+using+multi-representatives."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=A+density-based+cluster+validity+approach+using+multi-representatives."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=A+density-based+cluster+validity+approach+using+multi-representatives."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1016%2FJ.PATREC.2007.12.011"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.patrec.2007.12.011&text=%22A+density-based+cluster+validity+approach+using+multi-representatives.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.patrec.2007.12.011&text=%22A+density-based+cluster+validity+approach+using+multi-representatives.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.patrec.2007.12.011&title=%22A+density-based+cluster+validity+approach+using+multi-representatives.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.patrec.2007.12.011"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.patrec.2007.12.011&title=%22A+density-based+cluster+validity+approach+using+multi-representatives.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.patrec.2007.12.011"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/prl/HalkidiV08">https://dblp.org/rec/journals/prl/HalkidiV08</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">A density-based cluster validity approach using multi-representatives.</span> <a href="https://dblp.org/db/journals/prl/prl29.html#HalkidiV08"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">Pattern Recognit. Lett.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">29</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">6</span></span>)</a>: <span itemprop="pagination">773-786</span> (<span itemprop="datePublished">2008</span>)</cite><meta property="genre" content="computer science"></li><li class="entry article toc" id="journals/tkdd/HalkidiGVKD08" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j7">[j7]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/1324172.1324176"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/1324172.1324176" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1145%2F1324172.1324176"><a href="https://unpaywall.org/10.1145%2F1324172.1324176"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1145%2F1324172.1324176"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1145%2F1324172.1324176"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/tkdd/HalkidiGVKD08&rft.au=Maria+Halkidi&rft.atitle=A+clustering+framework+based+on+subjective+and+objective+validity+criteria.&rft.jtitle=ACM+Trans.+Knowl.+Discov.+Data&rft.volume=1&rft.issue=4&rft.date=2008&rft.pages=4%3A1-4%3A25&rft_id=info%3Adoi%2F10.1145%2F1324172.1324176&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/tkdd/HalkidiGVKD08</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+clustering+framework+based+on+subjective+and+objective+validity+criteria."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+clustering+framework+based+on+subjective+and+objective+validity+criteria."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+clustering+framework+based+on+subjective+and+objective+validity+criteria."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+clustering+framework+based+on+subjective+and+objective+validity+criteria."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=A+clustering+framework+based+on+subjective+and+objective+validity+criteria."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=A+clustering+framework+based+on+subjective+and+objective+validity+criteria."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1145%2F1324172.1324176"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F1324172.1324176&text=%22A+clustering+framework+based+on+subjective+and+objective+validity+criteria.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F1324172.1324176&text=%22A+clustering+framework+based+on+subjective+and+objective+validity+criteria.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F1324172.1324176&title=%22A+clustering+framework+based+on+subjective+and+objective+validity+criteria.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F1324172.1324176"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F1324172.1324176&title=%22A+clustering+framework+based+on+subjective+and+objective+validity+criteria.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F1324172.1324176"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/tkdd/HalkidiGVKD08">https://dblp.org/rec/journals/tkdd/HalkidiGVKD08</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/g/DimitriosGunopulos.html" itemprop="url"><span itemprop="name" title="Dimitrios Gunopulos">Dimitrios Gunopulos</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6339-1879"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/35/2565-2.html" itemprop="url"><span itemprop="name" title="Nitin Kumar 0002">Nitin Kumar</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/50/5158.html" itemprop="url"><span itemprop="name" title="Carlotta Domeniconi">Carlotta Domeniconi</span></a></span>:<br> <span class="title" itemprop="name">A clustering framework based on subjective and objective validity criteria.</span> <a href="https://dblp.org/db/journals/tkdd/tkdd1.html#HalkidiGVKD08"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">ACM Trans. Knowl. Discov. Data</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">1</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">4</span></span>)</a>: <span itemprop="pagination">4:1-4:25</span> (<span itemprop="datePublished">2008</span>)</cite><meta property="genre" content="computer science"></li><li class="year">2006</li><li class="entry article toc" id="journals/ijwmc/HalkidiPKG06" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j6">[j6]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1504/IJWMC.2006.012468"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1504/IJWMC.2006.012468" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1504%2FIJWMC.2006.012468"><a href="https://unpaywall.org/10.1504%2FIJWMC.2006.012468"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1504%2FIJWMC.2006.012468"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1504%2FIJWMC.2006.012468"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/ijwmc/HalkidiPKG06&rft.au=Maria+Halkidi&rft.atitle=Resilient+and+energy+efficient+tracking+in+sensor+networks.&rft.jtitle=Int.+J.+Wirel.+Mob.+Comput.&rft.volume=1&rft.issue=2&rft.date=2006&rft.pages=87-100&rft_id=info%3Adoi%2F10.1504%2FIJWMC.2006.012468&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/ijwmc/HalkidiPKG06</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Resilient+and+energy+efficient+tracking+in+sensor+networks."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Resilient+and+energy+efficient+tracking+in+sensor+networks."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Resilient+and+energy+efficient+tracking+in+sensor+networks."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Resilient+and+energy+efficient+tracking+in+sensor+networks."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Resilient+and+energy+efficient+tracking+in+sensor+networks."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Resilient+and+energy+efficient+tracking+in+sensor+networks."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1504%2FIJWMC.2006.012468"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1504%2FIJWMC.2006.012468&text=%22Resilient+and+energy+efficient+tracking+in+sensor+networks.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1504%2FIJWMC.2006.012468&text=%22Resilient+and+energy+efficient+tracking+in+sensor+networks.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1504%2FIJWMC.2006.012468&title=%22Resilient+and+energy+efficient+tracking+in+sensor+networks.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1504%2FIJWMC.2006.012468"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1504%2FIJWMC.2006.012468&title=%22Resilient+and+energy+efficient+tracking+in+sensor+networks.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1504%2FIJWMC.2006.012468"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/ijwmc/HalkidiPKG06">https://dblp.org/rec/journals/ijwmc/HalkidiPKG06</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/66/5996.html" itemprop="url"><span itemprop="name" title="Dimitris Papadopoulos">Dimitris Papadopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/k/VanaKalogeraki.html" itemprop="url"><span itemprop="name" title="Vana Kalogeraki">Vana Kalogeraki</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-6421-9947"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/g/DimitriosGunopulos.html" itemprop="url"><span itemprop="name" title="Dimitrios Gunopulos">Dimitrios Gunopulos</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6339-1879"></span>:<br> <span class="title" itemprop="name">Resilient and energy efficient tracking in sensor networks.</span> <a href="https://dblp.org/db/journals/ijwmc/ijwmc1.html#HalkidiPKG06"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">Int. J. Wirel. Mob. Comput.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">1</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">2</span></span>)</a>: <span itemprop="pagination">87-100</span> (<span itemprop="datePublished">2006</span>)</cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/mdm/HalkidiKGPZV06" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c11">[c11]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/MDM.2006.80"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/MDM.2006.80" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="https://doi.ieeecomputersociety.org/10.1109/MDM.2006.80" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FMDM.2006.80"><a href="https://unpaywall.org/10.1109%2FMDM.2006.80"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FMDM.2006.80"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FMDM.2006.80"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a><a href="https://www.wikidata.org/entity/Q57861923" itemprop="sameAs"><img alt="Wikidata" src="https://dblp.org/img/wikidata.dark.16x16.png" class="icon" title="Wikidata"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/mdm/HalkidiKGPZV06&rft.au=Maria+Halkidi&rft.atitle=Efficient+Online+State+Tracking+Using+Sensor+Networks.&rft.btitle=MDM&rft.date=2006&rft.pages=24&rft_id=info%3Adoi%2F10.1109%2FMDM.2006.80&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/mdm/HalkidiKGPZV06</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Efficient+Online+State+Tracking+Using+Sensor+Networks."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Efficient+Online+State+Tracking+Using+Sensor+Networks."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Efficient+Online+State+Tracking+Using+Sensor+Networks."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Efficient+Online+State+Tracking+Using+Sensor+Networks."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Efficient+Online+State+Tracking+Using+Sensor+Networks."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Efficient+Online+State+Tracking+Using+Sensor+Networks."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FMDM.2006.80"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2006.80&text=%22Efficient+Online+State+Tracking+Using+Sensor+Networks.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2006.80&text=%22Efficient+Online+State+Tracking+Using+Sensor+Networks.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2006.80&title=%22Efficient+Online+State+Tracking+Using+Sensor+Networks.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2006.80"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2006.80&title=%22Efficient+Online+State+Tracking+Using+Sensor+Networks.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FMDM.2006.80"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/mdm/HalkidiKGPZV06">https://dblp.org/rec/conf/mdm/HalkidiKGPZV06</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/k/VanaKalogeraki.html" itemprop="url"><span itemprop="name" title="Vana Kalogeraki">Vana Kalogeraki</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-6421-9947"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/g/DimitriosGunopulos.html" itemprop="url"><span itemprop="name" title="Dimitrios Gunopulos">Dimitrios Gunopulos</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6339-1879"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/66/5996.html" itemprop="url"><span itemprop="name" title="Dimitris Papadopoulos">Dimitris Papadopoulos</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/z/DemetriosZeinalipourYazti.html" itemprop="url"><span itemprop="name" title="Demetrios Zeinalipour-Yazti">Demetrios Zeinalipour-Yazti</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-7239-2387"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/04/2562.html" itemprop="url"><span itemprop="name" title="Michail Vlachos">Michail Vlachos</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0003-1008-5290"></span>:<br> <span class="title" itemprop="name">Efficient Online State Tracking Using Sensor Networks.</span> <a href="https://dblp.org/db/conf/mdm/mdm2006.html#HalkidiKGPZV06"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">MDM</span></span> <span itemprop="datePublished">2006</span></a>: <span itemprop="pagination">24</span></cite><meta property="genre" content="computer science"></li><li class="year">2005</li><li class="entry inproceedings toc" id="conf/icdm/HalkidiGKVD05" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c10">[c10]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/ICDM.2005.4"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/ICDM.2005.4" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="https://doi.ieeecomputersociety.org/10.1109/ICDM.2005.4" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FICDM.2005.4"><a href="https://unpaywall.org/10.1109%2FICDM.2005.4"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FICDM.2005.4"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FICDM.2005.4"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/icdm/HalkidiGKVD05&rft.au=Maria+Halkidi&rft.atitle=A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria.&rft.btitle=ICDM&rft.date=2005&rft.pages=637-640&rft_id=info%3Adoi%2F10.1109%2FICDM.2005.4&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/icdm/HalkidiGKVD05</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FICDM.2005.4"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2005.4&text=%22A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2005.4&text=%22A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2005.4&title=%22A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2005.4"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2005.4&title=%22A+Framework+for+Semi-Supervised+Learning+Based+on+Subjective+and+Objective+Clustering+Criteria.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2005.4"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/icdm/HalkidiGKVD05">https://dblp.org/rec/conf/icdm/HalkidiGKVD05</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/g/DimitriosGunopulos.html" itemprop="url"><span itemprop="name" title="Dimitrios Gunopulos">Dimitrios Gunopulos</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6339-1879"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/35/2565-2.html" itemprop="url"><span itemprop="name" title="Nitin Kumar 0002">Nitin Kumar</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/50/5158.html" itemprop="url"><span itemprop="name" title="Carlotta Domeniconi">Carlotta Domeniconi</span></a></span>:<br> <span class="title" itemprop="name">A Framework for Semi-Supervised Learning Based on Subjective and Objective Clustering Criteria.</span> <a href="https://dblp.org/db/conf/icdm/icdm2005.html#HalkidiGKVD05"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">ICDM</span></span> <span itemprop="datePublished">2005</span></a>: <span itemprop="pagination">637-640</span></cite><meta property="genre" content="computer science"></li><li class="entry incollection toc" id="books/sp/datamining2005/HalkidiV05" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Parts in Books or Collections" src="https://dblp.org/img/n.png"></div><div class="nr" id="p1">[p1]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><img alt="" src="https://dblp.org/img/paper.dark.empty.16x16.png" class="icon" itemprop="image"></div><div class="body"><p><b>no documents available</b></p><ul><li class="details"><a href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05.html"><img alt="" src="https://dblp.org/img/info.dark.hollow.16x16.png" class="icon">details & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Abooks/sp/datamining2005/HalkidiV05&rft.au=Maria+Halkidi&rft.atitle=Quality+Assessment+Approaches+in+Data+Mining.&rft.btitle=The+Data+Mining+and+Knowledge+Discovery+Handbook&rft.date=2005&rft.pages=661-696&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>books/sp/datamining2005/HalkidiV05</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Quality+Assessment+Approaches+in+Data+Mining."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=title%3A%28Quality+Assessment+Approaches+in+Data+Mining.%29"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdblp.org%2Frec%2Fbooks%2Fsp%2Fdatamining2005%2FHalkidiV05&text=%22Quality+Assessment+Approaches+in+Data+Mining.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdblp.org%2Frec%2Fbooks%2Fsp%2Fdatamining2005%2FHalkidiV05&text=%22Quality+Assessment+Approaches+in+Data+Mining.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdblp.org%2Frec%2Fbooks%2Fsp%2Fdatamining2005%2FHalkidiV05&title=%22Quality+Assessment+Approaches+in+Data+Mining.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdblp.org%2Frec%2Fbooks%2Fsp%2Fdatamining2005%2FHalkidiV05"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdblp.org%2Frec%2Fbooks%2Fsp%2Fdatamining2005%2FHalkidiV05&title=%22Quality+Assessment+Approaches+in+Data+Mining.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdblp.org%2Frec%2Fbooks%2Fsp%2Fdatamining2005%2FHalkidiV05"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/books/sp/datamining2005/HalkidiV05">https://dblp.org/rec/books/sp/datamining2005/HalkidiV05</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">Quality Assessment Approaches in Data Mining.</span> <a href="https://dblp.org/db/books/collections/datamining2005.html#HalkidiV05"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">The Data Mining and Knowledge Discovery Handbook</span></span> <span itemprop="datePublished">2005</span></a>: <span itemprop="pagination">661-696</span></cite><meta property="genre" content="computer science"></li><li class="year">2004</li><li class="entry article toc" id="journals/tkde/VarlamisVHN04" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j5">[j5]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/TKDE.2004.16"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/TKDE.2004.16" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="http://doi.ieeecomputersociety.org/10.1109/TKDE.2004.16" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FTKDE.2004.16"><a href="https://unpaywall.org/10.1109%2FTKDE.2004.16"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/tkde/VarlamisVHN04.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FTKDE.2004.16"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FTKDE.2004.16"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/tkde/VarlamisVHN04&rft.au=Iraklis+Varlamis&rft.atitle=THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics.&rft.jtitle=IEEE+Trans.+Knowl.+Data+Eng.&rft.volume=16&rft.issue=6&rft.date=2004&rft.pages=685-700&rft_id=info%3Adoi%2F10.1109%2FTKDE.2004.16&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/tkde/VarlamisVHN04.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkde/VarlamisVHN04.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkde/VarlamisVHN04.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkde/VarlamisVHN04.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkde/VarlamisVHN04.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkde/VarlamisVHN04.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/tkde/VarlamisVHN04.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/tkde/VarlamisVHN04</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FTKDE.2004.16"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FTKDE.2004.16&text=%22THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FTKDE.2004.16&text=%22THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FTKDE.2004.16&title=%22THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FTKDE.2004.16"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FTKDE.2004.16&title=%22THESUS%2C+a+Closer+View+on+Web+Content+Management+Enhanced+with+Link+Semantics.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FTKDE.2004.16"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/tkde/VarlamisVHN04">https://dblp.org/rec/journals/tkde/VarlamisVHN04</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/IraklisVarlamis.html" itemprop="url"><span itemprop="name" title="Iraklis Varlamis">Iraklis Varlamis</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-0876-8167"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/69/6924.html" itemprop="url"><span itemprop="name" title="Benjamin Nguyen">Benjamin Nguyen</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0003-0719-9684"></span>:<br> <span class="title" itemprop="name">THESUS, a Closer View on Web Content Management Enhanced with Link Semantics.</span> <a href="https://dblp.org/db/journals/tkde/tkde16.html#VarlamisVHN04"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">IEEE Trans. Knowl. Data Eng.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">16</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">6</span></span>)</a>: <span itemprop="pagination">685-700</span> (<span itemprop="datePublished">2004</span>)</cite><meta property="genre" content="computer science"></li><li class="year">2003</li><li class="entry book toc" id="books/sp/Vazirgiannis03" itemscope itemtype="http://schema.org/Book"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Books and Theses" src="https://dblp.org/img/n.png"></div><div class="nr" id="b2">[b2]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-1-4471-0031-7"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-1-4471-0031-7" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-1-4471-0031-7"><a href="https://unpaywall.org/10.1007%2F978-1-4471-0031-7"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/books/sp/Vazirgiannis03.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-1-4471-0031-7"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-1-4471-0031-7"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Abooks/sp/Vazirgiannis03&rft.au=Michalis+Vazirgiannis&rft.btitle=Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining.&rft.date=2003&rft.pages=1-226&rft.isbn=978-1-4471-1119-1&rft_id=info%3Adoi%2F10.1007%2F978-1-4471-0031-7&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/books/sp/Vazirgiannis03.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/Vazirgiannis03.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/Vazirgiannis03.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/Vazirgiannis03.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/Vazirgiannis03.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/Vazirgiannis03.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/books/sp/Vazirgiannis03.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>books/sp/Vazirgiannis03</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-1-4471-0031-7"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4471-0031-7&text=%22Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4471-0031-7&text=%22Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4471-0031-7&title=%22Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4471-0031-7"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4471-0031-7&title=%22Uncertainty+Handling+and+Quality+Assessment+in+Data+Mining.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-1-4471-0031-7"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/books/sp/Vazirgiannis03">https://dblp.org/rec/books/sp/Vazirgiannis03</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/g/DimitriosGunopulos.html" itemprop="url"><span itemprop="name" title="Dimitrios Gunopulos">Dimitrios Gunopulos</span></a></span>:<br> <span class="title" itemprop="name">Uncertainty Handling and Quality Assessment in Data Mining.</span> <a href="https://dblp.org/db/series/aikp/index.html"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">Advanced Information and Knowledge Processing</span></span></a>, <span itemprop="publisher">Springer</span> <span itemprop="datePublished">2003</span>, ISBN <span itemprop="isbn">978-1-4471-1119-1</span>, pp. 1-226</cite><meta property="genre" content="computer science"></li><li class="entry book toc" id="phd/gr/Halkidi03" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Books and Theses" src="https://dblp.org/img/n.png"></div><div class="nr" id="b1">[b1]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="http://hdl.handle.net/10442/hedi/17660"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="http://hdl.handle.net/10442/hedi/17660" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via handle.net</a></li><li class="details"><a href="https://dblp.org/rec/phd/gr/Halkidi03.html"><img alt="" src="https://dblp.org/img/info.dark.hollow.16x16.png" class="icon">details & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aphd/gr/Halkidi03&rft.au=Maria+Halkidi&rft.btitle=%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82&rft.date=2003&rft_id=http%3A%2F%2Fhdl.handle.net%2F10442%2Fhedi%2F17660&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/phd/gr/Halkidi03.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/phd/gr/Halkidi03.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/phd/gr/Halkidi03.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/phd/gr/Halkidi03.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/phd/gr/Halkidi03.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/phd/gr/Halkidi03.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/phd/gr/Halkidi03.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>phd/gr/Halkidi03</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82"><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82"><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82"><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82"><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82"><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82"><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=title%3A%28%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82%29"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=http%3A%2F%2Fhdl.handle.net%2F10442%2Fhedi%2F17660&text=%22%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=http%3A%2F%2Fhdl.handle.net%2F10442%2Fhedi%2F17660&text=%22%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+...%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=http%3A%2F%2Fhdl.handle.net%2F10442%2Fhedi%2F17660&title=%22%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=http%3A%2F%2Fhdl.handle.net%2F10442%2Fhedi%2F17660"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=http%3A%2F%2Fhdl.handle.net%2F10442%2Fhedi%2F17660&title=%22%CE%94%CE%B9%CE%B1%CF%87%CE%B5%CE%AF%CF%81%CE%B9%CF%83%CE%B7+%CF%80%CE%BF%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CE%BA%CE%B1%CE%B9+%CE%B1%CE%B2%CE%B5%CE%B2%CE%B1%CE%B9%CF%8C%CF%84%CE%B7%CF%84%CE%B1%CF%82+%CF%83%CE%B5+%CF%80%CE%B5%CF%81%CE%B9%CE%B2%CE%AC%CE%BB%CE%BB%CE%BF%CE%BD+%CE%B5%CE%BE%CF%8C%CF%81%CF%85%CE%BE%CE%B7%CF%82+%CE%B3%CE%BD%CF%8E%CF%83%CE%B7%CF%82%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=http%3A%2F%2Fhdl.handle.net%2F10442%2Fhedi%2F17660"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/phd/gr/Halkidi03">https://dblp.org/rec/phd/gr/Halkidi03</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>:<br> <span class="title" itemprop="name">Διαχείριση ποιότητας και αβεβαιότητας σε περιβάλλον εξόρυξης γνώσης.</span> Athens University Economics and Business, Greece, <span itemprop="datePublished">2003</span></cite><meta property="genre" content="computer science"></li><li class="entry article toc" id="journals/vldb/HalkidiNVV03" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j4">[j4]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/s00778-003-0100-6"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/s00778-003-0100-6" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2FS00778-003-0100-6"><a href="https://unpaywall.org/10.1007%2FS00778-003-0100-6"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/vldb/HalkidiNVV03.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2FS00778-003-0100-6"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2FS00778-003-0100-6"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/vldb/HalkidiNVV03&rft.au=Maria+Halkidi&rft.atitle=THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics.&rft.jtitle=VLDB+J.&rft.volume=12&rft.issue=4&rft.date=2003&rft.pages=320-332&rft_id=info%3Adoi%2F10.1007%2FS00778-003-0100-6&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/vldb/HalkidiNVV03.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/vldb/HalkidiNVV03.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/vldb/HalkidiNVV03.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/vldb/HalkidiNVV03.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/vldb/HalkidiNVV03.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/vldb/HalkidiNVV03.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/vldb/HalkidiNVV03.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/vldb/HalkidiNVV03</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2FS00778-003-0100-6"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs00778-003-0100-6&text=%22THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs00778-003-0100-6&text=%22THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs00778-003-0100-6&title=%22THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs00778-003-0100-6"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2Fs00778-003-0100-6&title=%22THESUS%3A+Organizing+Web+document+collections+based+on+link+semantics.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2Fs00778-003-0100-6"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/vldb/HalkidiNVV03">https://dblp.org/rec/journals/vldb/HalkidiNVV03</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/69/6924.html" itemprop="url"><span itemprop="name" title="Benjamin Nguyen">Benjamin Nguyen</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0003-0719-9684"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/IraklisVarlamis.html" itemprop="url"><span itemprop="name" title="Iraklis Varlamis">Iraklis Varlamis</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0002-0876-8167"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">THESUS: Organizing Web document collections based on link semantics.</span> <a href="https://dblp.org/db/journals/vldb/vldb12.html#HalkidiNVV03"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">VLDB J.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">12</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">4</span></span>)</a>: <span itemprop="pagination">320-332</span> (<span itemprop="datePublished">2003</span>)</cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/er/RizziBCGHTVVV03" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c9">[c9]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/978-3-540-39648-2_9"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/978-3-540-39648-2_9" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F978-3-540-39648-2_9"><a href="https://unpaywall.org/10.1007%2F978-3-540-39648-2_9"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F978-3-540-39648-2_9"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F978-3-540-39648-2_9"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/er/RizziBCGHTVVV03&rft.au=Stefano+Rizzi&rft.atitle=Towards+a+Logical+Model+for+Patterns.&rft.btitle=ER&rft.date=2003&rft.pages=77-90&rft_id=info%3Adoi%2F10.1007%2F978-3-540-39648-2_9&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/er/RizziBCGHTVVV03</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Towards+a+Logical+Model+for+Patterns."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Towards+a+Logical+Model+for+Patterns."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Towards+a+Logical+Model+for+Patterns."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Towards+a+Logical+Model+for+Patterns."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Towards+a+Logical+Model+for+Patterns."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Towards+a+Logical+Model+for+Patterns."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F978-3-540-39648-2_9"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-540-39648-2_9&text=%22Towards+a+Logical+Model+for+Patterns.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-540-39648-2_9&text=%22Towards+a+Logical+Model+for+Patterns.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-540-39648-2_9&title=%22Towards+a+Logical+Model+for+Patterns.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-540-39648-2_9"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-540-39648-2_9&title=%22Towards+a+Logical+Model+for+Patterns.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F978-3-540-39648-2_9"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/er/RizziBCGHTVVV03">https://dblp.org/rec/conf/er/RizziBCGHTVVV03</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/75/5487.html" itemprop="url"><span itemprop="name" title="Stefano Rizzi">Stefano Rizzi</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/b/ElisaBertino.html" itemprop="url"><span itemprop="name" title="Elisa Bertino">Elisa Bertino</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/c/BarbaraCatania.html" itemprop="url"><span itemprop="name" title="Barbara Catania">Barbara Catania</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/g/MatteoGolfarelli.html" itemprop="url"><span itemprop="name" title="Matteo Golfarelli">Matteo Golfarelli</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/t/ManolisTerrovitis.html" itemprop="url"><span itemprop="name" title="Manolis Terrovitis">Manolis Terrovitis</span></a><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0003-0784-8402"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/13/1242.html" itemprop="url"><span itemprop="name" title="Panos Vassiliadis">Panos Vassiliadis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/33/5819.html" itemprop="url"><span itemprop="name" title="Euripides Vrachnos">Euripides Vrachnos</span></a></span>:<br> <span class="title" itemprop="name">Towards a Logical Model for Patterns.</span> <a href="https://dblp.org/db/conf/er/er2003.html#RizziBCGHTVVV03"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">ER</span></span> <span itemprop="datePublished">2003</span></a>: <span itemprop="pagination">77-90</span></cite><meta property="genre" content="computer science"></li><li class="year">2002</li><li class="entry article toc" id="journals/sigmod/HalkidiBV02" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j3">[j3]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/565117.565124"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/565117.565124" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1145%2F565117.565124"><a href="https://unpaywall.org/10.1145%2F565117.565124"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/sigmod/HalkidiBV02.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1145%2F565117.565124"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1145%2F565117.565124"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/sigmod/HalkidiBV02&rft.au=Maria+Halkidi&rft.atitle=Cluster+Validity+Methods%3A+Part+I.&rft.jtitle=SIGMOD+Rec.&rft.volume=31&rft.issue=2&rft.date=2002&rft.pages=40-45&rft_id=info%3Adoi%2F10.1145%2F565117.565124&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/sigmod/HalkidiBV02</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Cluster+Validity+Methods%3A+Part+I."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Cluster+Validity+Methods%3A+Part+I."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Cluster+Validity+Methods%3A+Part+I."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Cluster+Validity+Methods%3A+Part+I."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Cluster+Validity+Methods%3A+Part+I."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Cluster+Validity+Methods%3A+Part+I."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1145%2F565117.565124"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F565117.565124&text=%22Cluster+Validity+Methods%3A+Part+I.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F565117.565124&text=%22Cluster+Validity+Methods%3A+Part+I.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F565117.565124&title=%22Cluster+Validity+Methods%3A+Part+I.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F565117.565124"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F565117.565124&title=%22Cluster+Validity+Methods%3A+Part+I.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F565117.565124"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/sigmod/HalkidiBV02">https://dblp.org/rec/journals/sigmod/HalkidiBV02</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/2588.html" itemprop="url"><span itemprop="name" title="Yannis Batistakis">Yannis Batistakis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">Cluster Validity Methods: Part I.</span> <a href="https://dblp.org/db/journals/sigmod/sigmod31.html#HalkidiBV02"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">SIGMOD Rec.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">31</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">2</span></span>)</a>: <span itemprop="pagination">40-45</span> (<span itemprop="datePublished">2002</span>)</cite><meta property="genre" content="computer science"></li><li class="entry article toc" id="journals/sigmod/HalkidiBV02a" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j2">[j2]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1145/601858.601862"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1145/601858.601862" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1145%2F601858.601862"><a href="https://unpaywall.org/10.1145%2F601858.601862"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1145%2F601858.601862"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1145%2F601858.601862"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/sigmod/HalkidiBV02a&rft.au=Maria+Halkidi&rft.atitle=Clustering+Validity+Checking+Methods%3A+Part+II.&rft.jtitle=SIGMOD+Rec.&rft.volume=31&rft.issue=3&rft.date=2002&rft.pages=19-27&rft_id=info%3Adoi%2F10.1145%2F601858.601862&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/sigmod/HalkidiBV02a</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Clustering+Validity+Checking+Methods%3A+Part+II."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Clustering+Validity+Checking+Methods%3A+Part+II."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Clustering+Validity+Checking+Methods%3A+Part+II."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Clustering+Validity+Checking+Methods%3A+Part+II."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Clustering+Validity+Checking+Methods%3A+Part+II."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Clustering+Validity+Checking+Methods%3A+Part+II."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1145%2F601858.601862"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F601858.601862&text=%22Clustering+Validity+Checking+Methods%3A+Part+II.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1145%2F601858.601862&text=%22Clustering+Validity+Checking+Methods%3A+Part+II.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1145%2F601858.601862&title=%22Clustering+Validity+Checking+Methods%3A+Part+II.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1145%2F601858.601862"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1145%2F601858.601862&title=%22Clustering+Validity+Checking+Methods%3A+Part+II.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1145%2F601858.601862"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/sigmod/HalkidiBV02a">https://dblp.org/rec/journals/sigmod/HalkidiBV02a</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/2588.html" itemprop="url"><span itemprop="name" title="Yannis Batistakis">Yannis Batistakis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">Clustering Validity Checking Methods: Part II.</span> <a href="https://dblp.org/db/journals/sigmod/sigmod31.html#HalkidiBV02a"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">SIGMOD Rec.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">31</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">3</span></span>)</a>: <span itemprop="pagination">19-27</span> (<span itemprop="datePublished">2002</span>)</cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/edbt/AmanatidisHV02" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c8">[c8]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/3-540-45876-X_55"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/3-540-45876-X_55" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F3-540-45876-X_55"><a href="https://unpaywall.org/10.1007%2F3-540-45876-X_55"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/edbt/AmanatidisHV02.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F3-540-45876-X_55"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F3-540-45876-X_55"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/edbt/AmanatidisHV02&rft.au=Christos+Amanatidis&rft.atitle=UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality.&rft.btitle=EDBT&rft.date=2002&rft.pages=762-765&rft_id=info%3Adoi%2F10.1007%2F3-540-45876-X_55&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/AmanatidisHV02.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/AmanatidisHV02.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/AmanatidisHV02.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/AmanatidisHV02.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/AmanatidisHV02.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/AmanatidisHV02.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/AmanatidisHV02.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/edbt/AmanatidisHV02</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F3-540-45876-X_55"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45876-X_55&text=%22UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45876-X_55&text=%22UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45876-X_55&title=%22UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45876-X_55"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45876-X_55&title=%22UMiner%3A+A+Data+Mining+System+Handling+Uncertainty+and+Quality.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45876-X_55"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/edbt/AmanatidisHV02">https://dblp.org/rec/conf/edbt/AmanatidisHV02</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/49/6432.html" itemprop="url"><span itemprop="name" title="Christos Amanatidis">Christos Amanatidis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">UMiner: A Data Mining System Handling Uncertainty and Quality.</span> <a href="https://dblp.org/db/conf/edbt/edbt2002.html#AmanatidisHV02"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">EDBT</span></span> <span itemprop="datePublished">2002</span></a>: <span itemprop="pagination">762-765</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/setn/HalkidiV02" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c7">[c7]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/3-540-46014-4_25"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/3-540-46014-4_25" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F3-540-46014-4_25"><a href="https://unpaywall.org/10.1007%2F3-540-46014-4_25"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/setn/HalkidiV02.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F3-540-46014-4_25"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F3-540-46014-4_25"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/setn/HalkidiV02&rft.au=Maria+Halkidi&rft.atitle=Managing+Uncertainty+and+Quality+in+the+Classification+Process.&rft.btitle=SETN&rft.date=2002&rft.pages=273-287&rft_id=info%3Adoi%2F10.1007%2F3-540-46014-4_25&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/setn/HalkidiV02.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/setn/HalkidiV02.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/setn/HalkidiV02.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/setn/HalkidiV02.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/setn/HalkidiV02.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/setn/HalkidiV02.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/setn/HalkidiV02.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/setn/HalkidiV02</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Managing+Uncertainty+and+Quality+in+the+Classification+Process."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Managing+Uncertainty+and+Quality+in+the+Classification+Process."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Managing+Uncertainty+and+Quality+in+the+Classification+Process."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Managing+Uncertainty+and+Quality+in+the+Classification+Process."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Managing+Uncertainty+and+Quality+in+the+Classification+Process."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Managing+Uncertainty+and+Quality+in+the+Classification+Process."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F3-540-46014-4_25"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-46014-4_25&text=%22Managing+Uncertainty+and+Quality+in+the+Classification+Process.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-46014-4_25&text=%22Managing+Uncertainty+and+Quality+in+the+Classification+Process.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-46014-4_25&title=%22Managing+Uncertainty+and+Quality+in+the+Classification+Process.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-46014-4_25"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-46014-4_25&title=%22Managing+Uncertainty+and+Quality+in+the+Classification+Process.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-46014-4_25"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/setn/HalkidiV02">https://dblp.org/rec/conf/setn/HalkidiV02</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">Managing Uncertainty and Quality in the Classification Process.</span> <a href="https://dblp.org/db/conf/setn/setn2002.html#HalkidiV02"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">SETN</span></span> <span itemprop="datePublished">2002</span></a>: <span itemprop="pagination">273-287</span></cite><meta property="genre" content="computer science"></li><li class="year">2001</li><li class="entry article toc" id="journals/jiis/HalkidiBV01" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Journal Articles" src="https://dblp.org/img/n.png"></div><div class="nr" id="j1">[j1]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1023/A:1012801612483"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1023/A:1012801612483" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1023%2FA%3A1012801612483"><a href="https://unpaywall.org/10.1023%2FA%3A1012801612483"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/journals/jiis/HalkidiBV01.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1023%2FA%3A1012801612483"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1023%2FA%3A1012801612483"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Ajournals/jiis/HalkidiBV01&rft.au=Maria+Halkidi&rft.atitle=On+Clustering+Validation+Techniques.&rft.jtitle=J.+Intell.+Inf.+Syst.&rft.volume=17&rft.issue=2-3&rft.date=2001&rft.pages=107-145&rft_id=info%3Adoi%2F10.1023%2FA%3A1012801612483&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/journals/jiis/HalkidiBV01.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/journals/jiis/HalkidiBV01.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/jiis/HalkidiBV01.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/jiis/HalkidiBV01.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/jiis/HalkidiBV01.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/jiis/HalkidiBV01.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/journals/jiis/HalkidiBV01.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>journals/jiis/HalkidiBV01</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=On+Clustering+Validation+Techniques."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=On+Clustering+Validation+Techniques."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=On+Clustering+Validation+Techniques."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=On+Clustering+Validation+Techniques."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=On+Clustering+Validation+Techniques."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=On+Clustering+Validation+Techniques."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1023%2FA%3A1012801612483"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1023%2FA%3A1012801612483&text=%22On+Clustering+Validation+Techniques.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1023%2FA%3A1012801612483&text=%22On+Clustering+Validation+Techniques.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1023%2FA%3A1012801612483&title=%22On+Clustering+Validation+Techniques.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1023%2FA%3A1012801612483"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1023%2FA%3A1012801612483&title=%22On+Clustering+Validation+Techniques.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1023%2FA%3A1012801612483"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/journals/jiis/HalkidiBV01">https://dblp.org/rec/journals/jiis/HalkidiBV01</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/2588.html" itemprop="url"><span itemprop="name" title="Yannis Batistakis">Yannis Batistakis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">On Clustering Validation Techniques.</span> <a href="https://dblp.org/db/journals/jiis/jiis17.html#HalkidiBV01"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/Periodical"><span itemprop="name">J. Intell. Inf. Syst.</span></span> <span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationVolume"><span itemprop="volumeNumber">17</span></span>(<span itemprop="isPartOf" itemscope itemtype="http://schema.org/PublicationIssue"><span itemprop="issueNumber">2-3</span></span>)</a>: <span itemprop="pagination">107-145</span> (<span itemprop="datePublished">2001</span>)</cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/icdm/HalkidiV01" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c6">[c6]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/ICDM.2001.989517"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/ICDM.2001.989517" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="https://doi.ieeecomputersociety.org/10.1109/ICDM.2001.989517" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FICDM.2001.989517"><a href="https://unpaywall.org/10.1109%2FICDM.2001.989517"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/icdm/HalkidiV01.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FICDM.2001.989517"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FICDM.2001.989517"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/icdm/HalkidiV01&rft.au=Maria+Halkidi&rft.atitle=Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set.&rft.btitle=ICDM&rft.date=2001&rft.pages=187-194&rft_id=info%3Adoi%2F10.1109%2FICDM.2001.989517&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiV01.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiV01.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiV01.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiV01.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiV01.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiV01.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/icdm/HalkidiV01.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/icdm/HalkidiV01</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FICDM.2001.989517"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2001.989517&text=%22Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2001.989517&text=%22Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2001.989517&title=%22Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2001.989517"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2001.989517&title=%22Clustering+Validity+Assessment%3A+Finding+the+Optimal+Partitioning+of+a+Data+Set.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FICDM.2001.989517"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/icdm/HalkidiV01">https://dblp.org/rec/conf/icdm/HalkidiV01</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">Clustering Validity Assessment: Finding the Optimal Partitioning of a Data Set.</span> <a href="https://dblp.org/db/conf/icdm/icdm2001.html#HalkidiV01"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">ICDM</span></span> <span itemprop="datePublished">2001</span></a>: <span itemprop="pagination">187-194</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/pkdd/HalkidiV01" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c5">[c5]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/3-540-44794-6_14"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/3-540-44794-6_14" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F3-540-44794-6_14"><a href="https://unpaywall.org/10.1007%2F3-540-44794-6_14"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/pkdd/HalkidiV01.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F3-540-44794-6_14"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F3-540-44794-6_14"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/pkdd/HalkidiV01&rft.au=Maria+Halkidi&rft.atitle=A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection.&rft.btitle=PKDD&rft.date=2001&rft.pages=165-179&rft_id=info%3Adoi%2F10.1007%2F3-540-44794-6_14&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiV01.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiV01.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiV01.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiV01.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiV01.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiV01.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiV01.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/pkdd/HalkidiV01</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F3-540-44794-6_14"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-44794-6_14&text=%22A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-44794-6_14&text=%22A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-44794-6_14&title=%22A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-44794-6_14"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-44794-6_14&title=%22A+Data+Set+Oriented+Approach+for+Clustering+Algorithm+Selection.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-44794-6_14"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/pkdd/HalkidiV01">https://dblp.org/rec/conf/pkdd/HalkidiV01</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">A Data Set Oriented Approach for Clustering Algorithm Selection.</span> <a href="https://dblp.org/db/conf/pkdd/pkdd2001.html#HalkidiV01"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">PKDD</span></span> <span itemprop="datePublished">2001</span></a>: <span itemprop="pagination">165-179</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/ssdbm/HalkidiBV01" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c4">[c4]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/SSDM.2001.938534"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/SSDM.2001.938534" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="ee"><a href="https://doi.ieeecomputersociety.org/10.1109/SSDM.2001.938534" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition @ ieeecomputersociety.org</a></li><li class="unpaywall display-none" data-doi="10.1109%2FSSDM.2001.938534"><a href="https://unpaywall.org/10.1109%2FSSDM.2001.938534"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FSSDM.2001.938534"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FSSDM.2001.938534"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/ssdbm/HalkidiBV01&rft.au=Maria+Halkidi&rft.atitle=Clustering+Algorithms+and+Validity+Measures.&rft.btitle=SSDBM&rft.date=2001&rft.pages=3-22&rft_id=info%3Adoi%2F10.1109%2FSSDM.2001.938534&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/ssdbm/HalkidiBV01</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Clustering+Algorithms+and+Validity+Measures."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Clustering+Algorithms+and+Validity+Measures."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Clustering+Algorithms+and+Validity+Measures."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Clustering+Algorithms+and+Validity+Measures."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Clustering+Algorithms+and+Validity+Measures."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Clustering+Algorithms+and+Validity+Measures."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FSSDM.2001.938534"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FSSDM.2001.938534&text=%22Clustering+Algorithms+and+Validity+Measures.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FSSDM.2001.938534&text=%22Clustering+Algorithms+and+Validity+Measures.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FSSDM.2001.938534&title=%22Clustering+Algorithms+and+Validity+Measures.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FSSDM.2001.938534"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FSSDM.2001.938534&title=%22Clustering+Algorithms+and+Validity+Measures.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FSSDM.2001.938534"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/ssdbm/HalkidiBV01">https://dblp.org/rec/conf/ssdbm/HalkidiBV01</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/2588.html" itemprop="url"><span itemprop="name" title="Yannis Batistakis">Yannis Batistakis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>:<br> <span class="title" itemprop="name">Clustering Algorithms and Validity Measures.</span> <a href="https://dblp.org/db/conf/ssdbm/ssdbm2001.html#HalkidiBV01"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">SSDBM</span></span> <span itemprop="datePublished">2001</span></a>: <span itemprop="pagination">3-22</span></cite><meta property="genre" content="computer science"></li><li class="year">2000</li><li class="entry inproceedings toc" id="conf/edbt/Halkidi00" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c3">[c3]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a class="archive" href="https://web.archive.org/web/*/http://www.edbt2000.uni-konstanz.de/phd-workshop/papers/Halkidi.pdf"><img alt="" src="https://dblp.org/img/paper-archive.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a class="archive" href="https://web.archive.org/web/*/http://www.edbt2000.uni-konstanz.de/phd-workshop/papers/Halkidi.pdf" itemprop="url"><img alt="" src="https://dblp.org/img/paper-archive.dark.16x16.png" class="icon">electronic edition @ uni-konstanz.de (archived)</a></li><li class="archive-scholar"><a href="https://scholar.archive.org/search?q=dblp_id:%22conf%2Fedbt%2FHalkidi00%22"><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">lookup Internet Archive Scholar</a></li><li class="details"><a href="https://dblp.org/rec/conf/edbt/Halkidi00.html"><img alt="" src="https://dblp.org/img/info.dark.hollow.16x16.png" class="icon">details & citations</a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/edbt/Halkidi00&rft.au=Maria+Halkidi&rft.atitle=Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process.&rft.btitle=EDBT+PhD+Workshop&rft.date=2000&rft_id=http%3A%2F%2Fwww.edbt2000.uni-konstanz.de%2Fphd-workshop%2Fpapers%2FHalkidi.pdf&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/Halkidi00.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/Halkidi00.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/Halkidi00.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/Halkidi00.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/Halkidi00.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/Halkidi00.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/edbt/Halkidi00.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/edbt/Halkidi00</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=title%3A%28Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process.%29"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=http%3A%2F%2Fwww.edbt2000.uni-konstanz.de%2Fphd-workshop%2Fpapers%2FHalkidi.pdf&text=%22Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=http%3A%2F%2Fwww.edbt2000.uni-konstanz.de%2Fphd-workshop%2Fpapers%2FHalkidi.pdf&text=%22Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=http%3A%2F%2Fwww.edbt2000.uni-konstanz.de%2Fphd-workshop%2Fpapers%2FHalkidi.pdf&title=%22Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=http%3A%2F%2Fwww.edbt2000.uni-konstanz.de%2Fphd-workshop%2Fpapers%2FHalkidi.pdf"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=http%3A%2F%2Fwww.edbt2000.uni-konstanz.de%2Fphd-workshop%2Fpapers%2FHalkidi.pdf&title=%22Quality+Assessment+and+Uncertainty+Handling+in+Data+Mining+Process.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=http%3A%2F%2Fwww.edbt2000.uni-konstanz.de%2Fphd-workshop%2Fpapers%2FHalkidi.pdf"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/edbt/Halkidi00">https://dblp.org/rec/conf/edbt/Halkidi00</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>:<br> <span class="title" itemprop="name">Quality Assessment and Uncertainty Handling in Data Mining Process.</span> <a href="https://dblp.org/db/conf/edbt/edbt2000phd.html#Halkidi00"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">EDBT PhD Workshop</span></span> <span itemprop="datePublished">2000</span></a></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/fuzzIEEE/VazirgiannisH00" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c2">[c2]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1109/FUZZY.2000.838692"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1109/FUZZY.2000.838692" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1109%2FFUZZY.2000.838692"><a href="https://unpaywall.org/10.1109%2FFUZZY.2000.838692"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1109%2FFUZZY.2000.838692"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1109%2FFUZZY.2000.838692"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/fuzzIEEE/VazirgiannisH00&rft.au=Michalis+Vazirgiannis&rft.atitle=Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic.&rft.btitle=FUZZ-IEEE&rft.date=2000&rft.pages=393-398&rft_id=info%3Adoi%2F10.1109%2FFUZZY.2000.838692&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/fuzzIEEE/VazirgiannisH00</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1109%2FFUZZY.2000.838692"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FFUZZY.2000.838692&text=%22Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1109%2FFUZZY.2000.838692&text=%22Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1109%2FFUZZY.2000.838692&title=%22Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1109%2FFUZZY.2000.838692"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1109%2FFUZZY.2000.838692&title=%22Uncertainty+handling+in+the+data+mining+process+with+fuzzy+logic.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1109%2FFUZZY.2000.838692"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00">https://dblp.org/rec/conf/fuzzIEEE/VazirgiannisH00</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span></span>:<br> <span class="title" itemprop="name">Uncertainty handling in the data mining process with fuzzy logic.</span> <a href="https://dblp.org/db/conf/fuzzIEEE/fuzzIEEE2000.html#VazirgiannisH00"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">FUZZ-IEEE</span></span> <span itemprop="datePublished">2000</span></a>: <span itemprop="pagination">393-398</span></cite><meta property="genre" content="computer science"></li><li class="entry inproceedings toc" id="conf/pkdd/HalkidiVB00" itemscope itemtype="http://schema.org/ScholarlyArticle"><link itemprop="additionalType" href="https://dblp.org/rdf/schema#Publication"><div class="box"><img alt="" title="Conference and Workshop Papers" src="https://dblp.org/img/n.png"></div><div class="nr" id="c1">[c1]</div><nav class="publ"><ul><li class="drop-down"><div class="head"><a href="https://doi.org/10.1007/3-540-45372-5_26"><img alt="" src="https://dblp.org/img/paper.dark.hollow.16x16.png" class="icon" itemprop="image"></a></div><div class="body"><p><b>view</b></p><ul><li class="ee"><a href="https://doi.org/10.1007/3-540-45372-5_26" itemprop="url"><img alt="" src="https://dblp.org/img/paper.dark.16x16.png" class="icon">electronic edition via DOI</a></li><li class="unpaywall display-none" data-doi="10.1007%2F3-540-45372-5_26"><a href="https://unpaywall.org/10.1007%2F3-540-45372-5_26"><img alt="" src="https://dblp.org/img/paper-unpaywall.dark.16x16.png" class="icon">unpaywalled version</a></li><li class="details"><a href="https://dblp.org/rec/conf/pkdd/HalkidiVB00.html"><img alt="" src="https://dblp.org/img/info.dark.16x16.png" class="icon">details & citations</a></li></ul><p><em>authority control:</em></p><ul><li class="wrap"><a href="https://api.crossref.org/works/10.1007%2F3-540-45372-5_26"><img alt="Crossref API" src="https://dblp.org/img/crossref.dark.16x16.png" class="icon" title="Crossref API"></a><a href="https://api.openalex.org/works/doi:10.1007%2F3-540-45372-5_26"><img alt="OpenAlex API" src="https://dblp.org/img/openalex.dark.16x16.png" class="icon" title="OpenAlex API"></a></li></ul><span class="Z3988" title="ctx_ver=Z39.88-2004&rfr_id=info%3Asid%2Fdblp.org%3Aconf/pkdd/HalkidiVB00&rft.au=Maria+Halkidi&rft.atitle=Quality+Scheme+Assessment+in+the+Clustering+Process.&rft.btitle=PKDD&rft.date=2000&rft.pages=265-276&rft_id=info%3Adoi%2F10.1007%2F3-540-45372-5_26&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal"><span style="display:none;"> </span></span></div></li><li class="drop-down"><div class="head"><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiVB00.html?view=bibtex"><img alt="" src="https://dblp.org/img/download.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>export record</b></p><ul><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiVB00.html?view=bibtex"><img alt="" src="https://dblp.org/img/bibtex.dark.16x16.png" class="icon">BibTeX</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiVB00.ris"><img alt="" src="https://dblp.org/img/endnote.dark.16x16.png" class="icon">RIS</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiVB00.nt"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF N-Triples</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiVB00.ttl"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF Turtle</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiVB00.rdf"><img alt="" src="https://dblp.org/img/rdf.dark.16x16.png" class="icon">RDF/XML</a></li><li><a rel="nofollow" href="https://dblp.org/rec/conf/pkdd/HalkidiVB00.xml"><img alt="" src="https://dblp.org/img/xml.dark.16x16.png" class="icon">XML</a></li></ul><p><em>dblp key:</em></p><ul class="bullets"><li class="select-on-click"><small>conf/pkdd/HalkidiVB00</small></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://google.com/search?q=Quality+Scheme+Assessment+in+the+Clustering+Process."><img alt="" src="https://dblp.org/img/search-external.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>ask others</b></p><ul><li><a href="https://google.com/search?q=Quality+Scheme+Assessment+in+the+Clustering+Process."><img alt="" src="https://dblp.org/img/google.dark.16x16.png" class="icon">Google</a></li><li><a href="https://scholar.google.com/scholar?q=Quality+Scheme+Assessment+in+the+Clustering+Process."><img alt="" src="https://dblp.org/img/google-scholar.dark.16x16.png" class="icon">Google Scholar</a></li><li><a href="https://www.semanticscholar.org/search?q=Quality+Scheme+Assessment+in+the+Clustering+Process."><img alt="" src="https://dblp.org/img/semscholar.dark.16x16.png" class="icon">Semantic Scholar</a></li><li><a rel="nofollow" href="https://scholar.archive.org/search?q=Quality+Scheme+Assessment+in+the+Clustering+Process."><img alt="" src="https://dblp.org/img/internetarchive.dark.16x16.png" class="icon">Internet Archive Scholar</a></li><li><a href="https://citeseerx.ist.psu.edu/search_result?query=Quality+Scheme+Assessment+in+the+Clustering+Process."><img alt="" src="https://dblp.org/img/citeseer.dark.16x16.png" class="icon">CiteSeerX</a></li><li><a href="https://www.pubpeer.com/search?q=doi%3A10.1007%2F3-540-45372-5_26"><img alt="" src="https://dblp.org/img/publons.dark.16x16.png" class="icon">PubPeer</a></li></ul></div></li><li class="drop-down"><div class="head"><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45372-5_26&text=%22Quality+Scheme+Assessment+in+the+Clustering+Process.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/link.dark.hollow.16x16.png" class="icon"></a></div><div class="body"><p><b>share record</b></p><ul><li><a href="https://twitter.com/intent/tweet?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45372-5_26&text=%22Quality+Scheme+Assessment+in+the+Clustering+Process.%22&hashtags=dblp&related=dblp_org"><img alt="" src="https://dblp.org/img/twitterbird.dark.16x16.png" class="icon">Twitter</a></li><li><a href="https://www.reddit.com/submit?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45372-5_26&title=%22Quality+Scheme+Assessment+in+the+Clustering+Process.%22"><img alt="" src="https://dblp.org/img/reddit.dark.16x16.png" class="icon">Reddit</a></li><li><a href="https://www.bibsonomy.org/editPublication?url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45372-5_26"><img alt="" src="https://dblp.org/img/bibsonomy.dark.16x16.png" class="icon">BibSonomy</a></li><li><a href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45372-5_26&title=%22Quality+Scheme+Assessment+in+the+Clustering+Process.%22&source=dblp+computer+science+bibliography"><img alt="" src="https://dblp.org/img/linkedin.dark.16x16.png" class="icon">LinkedIn</a></li><li><a href="https://www.facebook.com/sharer/sharer.php?u=https%3A%2F%2Fdoi.org%2F10.1007%2F3-540-45372-5_26"><img alt="" src="https://dblp.org/img/facebook.dark.16x16.png" class="icon">Facebook</a></li></ul><p><em>persistent URL:</em></p><ul class="bullets"><li><small><a href="https://dblp.org/rec/conf/pkdd/HalkidiVB00">https://dblp.org/rec/conf/pkdd/HalkidiVB00</a></small></li></ul></div></li></ul></nav><cite class="data tts-content" itemprop="headline"><span itemprop="author" itemscope itemtype="http://schema.org/Person"><span class="this-person" itemprop="name">Maria Halkidi</span><img src="https://dblp.org/img/orcid-mark.12x12.png" style="padding-left:0.25em;" alt="" title="0000-0001-6282-824X"></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/v/MVazirgiannis.html" itemprop="url"><span itemprop="name" title="Michalis Vazirgiannis">Michalis Vazirgiannis</span></a></span>, <span itemprop="author" itemscope itemtype="http://schema.org/Person"><a href="https://dblp.org/pid/14/2588.html" itemprop="url"><span itemprop="name" title="Yannis Batistakis">Yannis Batistakis</span></a></span>:<br> <span class="title" itemprop="name">Quality Scheme Assessment in the Clustering Process.</span> <a href="https://dblp.org/db/conf/pkdd/pkdd2000.html#HalkidiVB00"><span itemprop="isPartOf" itemscope itemtype="http://schema.org/BookSeries"><span itemprop="name">PKDD</span></span> <span itemprop="datePublished">2000</span></a>: <span itemprop="pagination">265-276</span></cite><meta property="genre" content="computer science"></li></ul></div></div></div><div class="clear-both"></div><div id="coauthor-side-panel" class="panel js-only"></div> <div id="coauthor-section" class="section"><div class="hideable"><header id="coauthors" class="hide-head h2"><h2>Coauthor Index</h2> <div class="drop-down faq"><div class="head"><a href="https://dblp.org/faq/"><img alt="FAQ" src="https://dblp.org/img/faq-mark.dark.12x12.png"></a></div><div class="body"><b>see FAQ</b><ul><li><a href="https://dblp.org/faq/1474792">What is the meaning of the colors in the coauthor index?</a></li><li><a href="https://dblp.org/faq/8388649">How does dblp detect coauthor communities?</a></li></ul></div></div></header><div class="index hide-body hidden"><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=1" title="show joint publications">1</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/49/6432.html">Christos Amanatidis</a></div><div><a href="#c8">[c8]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=2" title="show joint publications">2</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/194/4715.html">Anneta Ampla</a></div><div><a href="#c22">[c22]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=3" title="show joint publications">3</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/14/2588.html">Yannis Batistakis</a></div><div><a href="#j3">[j3]</a> <a href="#j2">[j2]</a> <a href="#j1">[j1]</a> <a href="#c4">[c4]</a> <a href="#c1">[c1]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=4" title="show joint publications">4</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/b/ElisaBertino.html">Elisa Bertino</a></div><div><a href="#c9">[c9]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=5" title="show joint publications">5</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/c/BarbaraCatania.html">Barbara Catania</a></div><div><a href="#c9">[c9]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=6" title="show joint publications">6</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/50/5158.html">Carlotta Domeniconi</a></div><div><a href="#j7">[j7]</a> <a href="#c10">[c10]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=7" title="show joint publications">7</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/14/3086.html">Christos Doulkeridis</a></div><div><a href="#c22">[c22]</a> <a href="#c19">[c19]</a> <a href="#c17">[c17]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=8" title="show joint publications">8</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/27/176.html">Emmanouel A. Giakoumakis</a></div><div><a href="#c12">[c12]</a> <a href="#i1">[i1]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=9" title="show joint publications">9</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/g/AristidesGionis.html">Aristides Gionis</a></div><div><a href="#c20">[c20]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=10" title="show joint publications">10</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/g/MatteoGolfarelli.html">Matteo Golfarelli</a></div><div><a href="#c9">[c9]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=11" title="show joint publications">11</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/63/3664.html">Francesco Gullo</a></div><div><a href="#c21">[c21]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=12" title="show joint publications">12</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/g/DimitriosGunopulos.html">Dimitrios Gunopulos</a></div><div><a href="#j7">[j7]</a> <a href="#j6">[j6]</a> <a href="#c11">[c11]</a> <a href="#c10">[c10]</a> <a href="#b2">[b2]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=13" title="show joint publications">13</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/k/VanaKalogeraki.html">Vana Kalogeraki</a></div><div><a href="#j6">[j6]</a> <a href="#c11">[c11]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=14" title="show joint publications">14</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/186/7746.html">Maria Karanasou</a></div><div><a href="#c22">[c22]</a> <a href="#c19">[c19]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=15" title="show joint publications">15</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/03/1746.html">Iordanis Koutsopoulos</a></div><div><a href="#c25">[c25]</a> <a href="#j12">[j12]</a> <a href="#c24">[c24]</a> <a href="#c23">[c23]</a> <a href="#c21">[c21]</a> <a href="#c20">[c20]</a> <a href="#j11">[j11]</a> <a href="#c16">[c16]</a> <a href="#c15">[c15]</a> <a href="#c14">[c14]</a> <a href="#c13">[c13]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=16" title="show joint publications">16</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/35/2565-2.html">Nitin Kumar <span class="homonym-nr">0002</span></a></div><div><a href="#j7">[j7]</a> <a href="#c10">[c10]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=17" title="show joint publications">17</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/69/6924.html">Benjamin Nguyen</a></div><div><a href="#j5">[j5]</a> <a href="#j4">[j4]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=18" title="show joint publications">18</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/66/5996.html">Dimitris Papadopoulos</a></div><div><a href="#j6">[j6]</a> <a href="#c11">[c11]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=19" title="show joint publications">19</a></div><div class="col-boxes" data-col="1"><div></div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=2"><img alt="2" class="col-1" title="show coauthor community: group 2" src="https://dblp.org/img/n.png"></a></div><div class="person"><a href="https://dblp.org/pid/63/11335.html">Aikaterini Pavlou</a></div><div><a href="#c18">[c18]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=20" title="show joint publications">20</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/75/5487.html">Stefano Rizzi</a></div><div><a href="#c9">[c9]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=21" title="show joint publications">21</a></div><div class="col-boxes" data-col="1"><div></div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=2"><img alt="2" class="col-1" title="show coauthor community: group 2" src="https://dblp.org/img/n.png"></a></div><div class="person"><a href="https://dblp.org/pid/s/MyraSpiliopoulou.html">Myra Spiliopoulou</a></div><div><a href="#c18">[c18]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=22" title="show joint publications">22</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/s/DiomidisSpinellis.html">Diomidis Spinellis</a></div><div><a href="#j10">[j10]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=23" title="show joint publications">23</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/t/ManolisTerrovitis.html">Manolis Terrovitis</a></div><div><a href="#c9">[c9]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=24" title="show joint publications">24</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/14/2922.html">George Tsatsaronis <span class="homonym-nr">0001</span></a></div><div><a href="#j10">[j10]</a> <a href="#c12">[c12]</a> <a href="#i1">[i1]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=25" title="show joint publications">25</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/10/8612.html">Puya Vahabi</a><br><small>aka: Hossein Vahabi</small></div><div><a href="#c21">[c21]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=26" title="show joint publications">26</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/v/IraklisVarlamis.html">Iraklis Varlamis</a></div><div><a href="#j5">[j5]</a> <a href="#j4">[j4]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=27" title="show joint publications">27</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/13/1242.html">Panos Vassiliadis</a></div><div><a href="#c9">[c9]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=28" title="show joint publications">28</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/v/MVazirgiannis.html">Michalis Vazirgiannis</a></div><div><a href="#j10">[j10]</a> <a href="#p2">[p2]</a> <a href="#j9">[j9]</a> <a href="#j8">[j8]</a> <a href="#j7">[j7]</a> <a href="#c10">[c10]</a> <a href="#p1">[p1]</a> <a href="#j5">[j5]</a> <a href="#b2">[b2]</a> <a href="#j4">[j4]</a> <a href="#c9">[c9]</a> <a href="#j3">[j3]</a> <a href="#j2">[j2]</a> <a href="#c8">[c8]</a> <a href="#c7">[c7]</a> <a href="#j1">[j1]</a> <a href="#c6">[c6]</a> <a href="#c5">[c5]</a> <a href="#c4">[c4]</a> <a href="#c2">[c2]</a> <a href="#c1">[c1]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=29" title="show joint publications">29</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/04/2562.html">Michail Vlachos</a></div><div><a href="#c11">[c11]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=30" title="show joint publications">30</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/15/6276.html">Akrivi Vlachou</a></div><div><a href="#c17">[c17]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=31" title="show joint publications">31</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/33/5819.html">Euripides Vrachnos</a></div><div><a href="#c9">[c9]</a> </div></div><div><div><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=joint&param=32" title="show joint publications">32</a></div><div class="col-boxes" data-col="0"><a rel="nofollow" href="https://dblp.org/pid/99/5919.html?view=group&param=1"><img alt="1" class="col-0" title="show coauthor community: group 1" src="https://dblp.org/img/n.png"></a><div></div></div><div class="person"><a href="https://dblp.org/pid/z/DemetriosZeinalipourYazti.html">Demetris Zeinalipour</a><br><small>aka: Demetrios Zeinalipour-Yazti</small></div><div><a href="#c11">[c11]</a> </div></div></div></div></div> <div id="settings" class="js-only"><div class="drop-down"><div class="head"><img alt="" src="https://dblp.org/img/cog.dark.24x24.png" class="icon"></div><div class="body"><p><b>manage site settings</b></p><div class="scrollbox"><p>To protect your privacy, all features that rely on external API calls from your browser are <em>turned off by default</em>. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information <a href="https://dblp.org/faq/15696107">see our F.A.Q.</a></p><div class="medskip"></div><div class="unpaywall-settings hideable hidden"><p class="hide-head"><em>Unpaywalled article links</em></p><div class="hide-body"><p>Add open access links from <a href="https://unpaywall.org"><img alt="unpaywall.org" src="https://dblp.org/img/unpaywall-logo.80x16.png" style="vertical-align:-5px;"></a> to the list of external document links (if available).</p><p class="unpaywall-load load-button"><input type="checkbox"><a><strong>load links from unpaywall.org</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the API of <em>unpaywall.org</em> to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the <a class="external" href="http://unpaywall.org/legal/privacy">Unpaywall privacy policy</a>.</small></p></div></div><div class="archive-settings hideable hidden"><p class="hide-head"><em>Archived links via Wayback Machine</em></p><div class="hide-body"><p>For web page which are no longer available, try to retrieve content from the <a href="https://web.archive.org"><img alt="web.archive.org" src="https://dblp.org/img/wayback-logo.72x14.png" style="vertical-align:-2px;"></a> of the Internet Archive (if available).</p><p class="archive-load load-button"><input type="checkbox"><a><strong>load content from archive.org</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the API of <em>archive.org</em> to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the <a class="external" href="https://archive.org/about/terms.php">Internet Archive privacy policy</a>.</small></p></div></div><div class="references-settings hideable hidden"><p class="hide-head"><em>Reference lists</em></p><div class="hide-body"><p>Add a list of references from <a href="https://crossref.org"><img alt="crossref.org" src="https://dblp.org/img/crossref-logo.60x15.png" style="vertical-align:-2px;"></a>, <a href="https://opencitations.net"><img alt="opencitations.net" src="https://dblp.org/img/opencitations-logo.110x14.png" style="vertical-align:-2px;"></a>, and <a href="https://semanticscholar.org"><img alt="semanticscholar.org" src="https://dblp.org/img/semanticscholar-logo.128x16.png" style="vertical-align:-4px;"></a> to record detail pages.</p><p class="references-load load-button"><input type="checkbox"><a><strong>load references from crossref.org and opencitations.net</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the APIs of <em>crossref.org</em>, <em>opencitations.net</em>, and <em>semanticscholar.org</em> to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the <a class="external" href="https://www.crossref.org/privacy/">Crossref privacy policy</a> and the <a class="external" href="https://opencitations.net/about">OpenCitations privacy policy</a>, as well as the <a class="external" href="https://allenai.org/privacy-policy">AI2 Privacy Policy</a> covering Semantic Scholar.</small></p></div></div><div class="citations-settings hideable hidden"><p class="hide-head"><em>Citation data</em></p><div class="hide-body"><p>Add a list of citing articles from <a href="https://opencitations.net"><img alt="opencitations.net" src="https://dblp.org/img/opencitations-logo.110x14.png" style="vertical-align:-2px;"></a> and <a href="https://semanticscholar.org"><img alt="semanticscholar.org" src="https://dblp.org/img/semanticscholar-logo.128x16.png" style="vertical-align:-4px;"></a> to record detail pages.</p><p class="citations-load load-button"><input type="checkbox"><a><strong>load citations from opencitations.net</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the API of <em>opencitations.net</em> and <em>semanticscholar.org</em> to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the <a class="external" href="https://opencitations.net/about">OpenCitations privacy policy</a> as well as the <a class="external" href="https://allenai.org/privacy-policy">AI2 Privacy Policy</a> covering Semantic Scholar.</small></p></div></div><div class="openalex-settings hideable hidden"><p class="hide-head"><em>OpenAlex data</em></p><div class="hide-body"><p>Load additional information about publications from <a href="https://openalex.org"><img alt="openalex.org" src="https://dblp.org/img/openalex-logo.69x18.png" style="vertical-align:-2px;"></a>.<p class="openalex-load load-button"><input type="checkbox"><a><strong>load data from openalex.org</strong></a></p><p><small>Privacy notice: By enabling the option above, your browser will contact the API of <em>openalex.org</em> to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by <a class="external" href="https://openalex.org/about">OpenAlex</a>.</small></p></div></div></div></div></div></div><div class="clear-both"></div><div id="footer"><div class="info"><p><a rel="nofollow" href="https://validator.w3.org/nu/?doc=https%3A%2F%2Fdblp.org%2Fpid%2F99%2F5919.html&showoutline=yes&checkerrorpages=yes"> <img alt="w3c valid html" src="https://dblp.org/img/w3c-valid-html.80x15.gray.png"></a> last updated on 2024-10-09 20:29 CEST by the <a href="https://dblp.org/db/about/team.html">dblp team</a></p><p><a href="https://creativecommons.org/publicdomain/zero/1.0/"><img alt="cc zero" src="https://dblp.org/img/cc0.80x15.black.png"></a> all metadata released as <a class="external" href="https://opendefinition.org/">open data</a> under <a class="external" href="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 license</a></p><p>see also: <a href="https://dblp.org/db/about/copyright.html">Terms of Use</a> | <a href="https://dblp.org/db/about/privacy.html">Privacy Policy</a> | <a href="https://dblp.org/db/about/imprint.html">Imprint</a></p></div><div class="funders"><p>dblp was originally created in 1993 at:</p><a href="https://www.uni-trier.de/en/"><img alt="University of Trier" src="https://dblp.org/img/utr-logo-bottom.png" style="height:32px"></a>   </div><div class="funders"><p>since 2018, dblp has been operated and maintained by:</p><a href="https://www.dagstuhl.de/en/"><img alt="Schloss Dagstuhl - Leibniz Center for Informatics" src="https://dblp.org/img/lzi-logo-bottom.png" style="height:40px"></a>   </div><div class="funders"><p>the dblp computer science bibliography is funded and supported by:</p><a href="https://www.bmbf.de/bmbf/en/home/"><img alt="BMBF" src="https://dblp.org/img/bmbf-logo-bottom.png"></a>   <a href="https://mwg.rlp.de/"><img alt="RLP" src="https://dblp.org/img/rlp-logo-bottom.png"></a>   <a href="https://www.saarland.de/stk/DE/home/home_node.html"><img alt="SL" src="https://dblp.org/img/sl-logo-bottom.png"></a>   <a href="https://www.leibniz-gemeinschaft.de/en/"><img alt="Leibniz" src="https://dblp.org/img/leibniz-logo-bottom.png"></a>   <a href="https://www.dfg.de/en/"><img alt="DFG" src="https://dblp.org/img/dfg-logo-bottom.png"></a>   <a href="https://www.nfdi.de/?lang=en"><img alt="NFDI" src="https://dblp.org/img/nfdi-logo-bottom.png"></a>   </div></div> </div> <script src="https://dblp.org/js/dblp-2024-09-09.min.js"></script><script src="https://dblp.org/js/dblp-search-2020-08-18.min.js"></script><script src="https://dblp.org/js/dblp-authorpage-2023-05-25.min.js"></script><script src="https://dblp.org/js/dblp-ui-2024-10-24.min.js"></script></body> </html>