default search action
Stefanos Ougiaroglou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Charalampos Bratsas
, Efstathios Konstantinos Anastasiadis
Knowledge Graphs and Semantic Web Tools in Cyber Threat Intelligence: A Systematic Literature Review. J. Cybersecur. Priv. 4(3): 518-545 (2024) - [j15]Stefanos Ougiaroglou
Reduction Through Homogeneous Clustering: Variations for Categorical Data and Fast Data Reduction. SN Comput. Sci. 5(6): 671 (2024) - [c32]Stylianos Eleftheriadis
An Empirical Analysis of Data Reduction Techniques for k-NN Classification. AIAI (4) 2024: 83-97 - [c31]Matthaios Zografos, Stefanos Ougiaroglou
Simplifying Decision Tree Classification Through the AutoDTrees Web Application and Service. ITS (2) 2024: 162-173 - [c30]Kiriakos Sgardelis, Dionisis Margaris, Dimitris Spiliotopoulos, Costas Vassilakis, Stefanos Ougiaroglou:
Improving Recommendation Quality in Collaborative Filtering by Including Prediction Confidence Factors. WEBIST 2024: 372-379 - 2023
- [j14]Dionisis Margaris
Rating Prediction Quality Enhancement in Low-Density Collaborative Filtering Datasets. Big Data Cogn. Comput. 7(2): 59 (2023) - [j13]Konstantinos Gratsos, Stefanos Ougiaroglou
kClusterHub: An AutoML-Driven Tool for Effortless Partition-Based Clustering over Varied Data Types. Future Internet 15(10): 341 (2023) - [j12]Stefanos Ougiaroglou, Panagiotis Filippakis, Georgia Fotiadou, Georgios Evangelidis:
Data reduction via multi-label prototype generation. Neurocomputing 526: 1-8 (2023) - [j11]Panagiotis Filippakis
Prototype Selection for Multilabel Instance-Based Learning. Inf. 14(10): 572 (2023) - [c29]Panagiotis Filippakis
Condensed Nearest Neighbour Rules for Multi-Label Datasets. IDEAS 2023: 43-50 - [c28]Stefanos Ougiaroglou
Very fast variations of training set size reduction algorithms for instance-based classification. IDEAS 2023: 64-70 - [c27]Konstantinos Gratsos, Stefanos Ougiaroglou
A Web Tool for K-means Clustering. NiDS (1) 2023: 91-101 - 2022
- [j10]Stefanos Ougiaroglou
Fast Training Set Size Reduction Using Simple Space Partitioning Algorithms. Inf. 13(12): 572 (2022) - [j9]Thomas Giorginis, Stefanos Ougiaroglou
Fast data reduction by space partitioning via convex hull and MBR computation. Pattern Recognit. 126: 108553 (2022) - 2021
- [c26]Stefanos Ougiaroglou
Prototype Generation for Multi-label Nearest Neighbours Classification. HAIS 2021: 172-183 - [c25]Merkourios Papanikolaou, Georgios Evangelidis, Stefanos Ougiaroglou
Dynamic k determination in k-NN classifier: A literature review. IISA 2021: 1-8 - [c24]Konstantinos Xouveroudis, Stefanos Ougiaroglou
Prototype Selection and Generation with Minority Classes Preservation. IISA 2021: 1-8 - 2020
- [j8]Stefanos Ougiaroglou
Instance-based classification using prototypes generated from large noisy and streaming datasets. Comput. Sci. Inf. Syst. 17(1): 71-92 (2020) - [c23]Stefanos Ougiaroglou
Dynamic k-NN Classification Based on Region Homogeneity. ADBIS (Short Papers) 2020: 27-37 - [c22]Konstantinos Malliaridis, Stefanos Ougiaroglou
WebApriori: A Web Application for Association Rules Mining. ITS 2020: 371-377
2010 – 2019
- 2019
- [c21]Pavlos Ponos, Stefanos Ougiaroglou
Improving Data Reduction by Merging Prototypes. ADBIS 2019: 20-32 - [c20]Pavlos Ponos, Stefanos Ougiaroglou, Georgios Evangelidis:
The Effect of Parallelism on Data Reduction. BCI 2019: 33:1-33:4 - [c19]George Pardis, Konstantinos I. Diamantaras, Stefanos Ougiaroglou
Fast Tree-Based Classification via Homogeneous Clustering. IDEAL (1) 2019: 514-524 - 2018
- [j7]Stefanos Ougiaroglou
Exploring the effect of data reduction on Neural Network and Support Vector Machine classification. Neurocomputing 280: 101-110 (2018) - 2017
- [c18]Stefanos Ougiaroglou
Generating Fixed-Size Training Sets for Large and Streaming Datasets. ADBIS 2017: 88-102 - [c17]Stavri Skourti, Georgios Tzinos, Dimitris A. Dervos
Crowd gaming: Motivating learning with outdoor activities. EDUCON 2017: 1251-1257 - 2016
- [j6]Stefanos Ougiaroglou
Efficient editing and data abstraction by finding homogeneous clusters. Ann. Math. Artif. Intell. 76(3-4): 327-349 (2016) - [j5]Stefanos Ougiaroglou
RHC: a non-parametric cluster-based data reduction for efficient k-NN classification. Pattern Anal. Appl. 19(1): 93-109 (2016) - [c16]Stefanos Ougiaroglou
Efficient Support Vector Machine Classification Using Prototype Selection and Generation. AIAI 2016: 328-340 - 2015
- [j4]Stefanos Ougiaroglou
FHC: an adaptive fast hybrid method for k-NN classification. Log. J. IGPL 23(3): 431-450 (2015) - [c15]Stefanos Ougiaroglou
Dealing with noisy data in the context of k-NN Classification. BCI 2015: 28:1-28:4 - 2014
- [b1]Stefanos Ougiaroglou:
Algorithms and techniques for efficient and effective nearest neighbours classification. University of Macedonia, Greece, 2014 - [j3]Stefanos Ougiaroglou
Efficient $$k$$ k -NN classification based on homogeneous clusters. Artif. Intell. Rev. 42(3): 491-513 (2014) - [j2]Stefanos Ougiaroglou
Efficient data abstraction using weighted IB2 prototypes. Comput. Sci. Inf. Syst. 11(2): 665-678 (2014) - [c14]Stefanos Ougiaroglou
EHC: Non-parametric Editing by Finding Homogeneous Clusters. FoIKS 2014: 290-304 - [c13]Stefanos Ougiaroglou
WebDR: A Web Workbench for Data Reduction. ECML/PKDD (3) 2014: 464-467 - 2013
- [c12]Stefanos Ougiaroglou
AIB2: an abstraction data reduction technique based on IB2. BCI 2013: 13-16 - [c11]Stefanos Ougiaroglou
Applying General-Purpose Data Reduction Techniques for Fast Time Series Classification. ICANN 2013: 34-41 - [i1]Stefanos Ougiaroglou, Georgios Evangelidis, Dimitrios Dervos:
An Extensive Experimental Study on the Cluster-based Reference Set Reduction for speeding-up the k-NN Classifier. CoRR abs/1309.7750 (2013) - 2012
- [c10]Stefanos Ougiaroglou
Efficient dataset size reduction by finding homogeneous clusters. BCI 2012: 168-173 - [c9]Stefanos Ougiaroglou
An Adaptive Hybrid and Cluster-Based Model for Speeding Up the k-NN Classifier. HAIS (2) 2012: 163-175 - [c8]Stefanos Ougiaroglou
A Simple Noise-Tolerant Abstraction Algorithm for Fast k-NN Classification. HAIS (2) 2012: 210-221 - [c7]Stefanos Ougiaroglou
Association Rules Mining from the Educational Data of ESOG Web-Based Application. AIAI (2) 2012: 105-114 - [c6]Stefanos Ougiaroglou
A Fast Hybrid k-NN Classifier Based on Homogeneous Clusters. AIAI (1) 2012: 327-336 - [c5]Stefanos Ougiaroglou
Fast and Accurate k-Nearest Neighbor Classification Using Prototype Selection by Clustering. Panhellenic Conference on Informatics 2012: 168-173 - 2011
- [c4]Stefanos Ougiaroglou
Occupational Guidance through ELECTRE Method. ICWL 2011: 142-147 - [c3]Stefanos Ougiaroglou
A fast hybrid classification algorithm based on the minimum distance and the k-NN classifiers. SISAP 2011: 97-104
2000 – 2009
- 2009
- [j1]Eleftherios Tiakas, Stefanos Ougiaroglou
Efficient algorithms for constructing broadcast disks programs in asymmetric communication environments. Telecommun. Syst. 41(3): 185-209 (2009) - 2007
- [c2]Stefanos Ougiaroglou
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors. ADBIS 2007: 66-82 - [c1]Eleftherios Tiakas, Stefanos Ougiaroglou
Efficient broadcast disks program construction in asymmetric communication environments. MSWiM 2007: 279-283
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. 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 see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org 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 Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org 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 Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org 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 Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org 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 OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org 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 OpenAlex.
last updated on 2024-12-13 19:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: