default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBasilis Boutsinas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Antiopi Panteli
, Basilis Boutsinas:
Addressing the Cold-Start Problem in Recommender Systems Based on Frequent Patterns. Algorithms 16(4): 182 (2023)- [j18]Antiopi Panteli, Basilis Boutsinas:
Improvement of similarity-diversity trade-off in recommender systems based on a facility location model. Neural Comput. Appl. 35(1): 177-189 (2023) - [j17]Antiopi Panteli, Basilis Boutsinas:
Correction to: Improvement of similarity-diversity trade-off in recommender systems based on a facility location model. Neural Comput. Appl. 35(1): 191 (2023) - 2021
- [j16]Antiopi Panteli, Basilis Boutsinas, Ioannis Giannikos:
On solving the multiple p-median problem based on biclustering. Oper. Res. 21(1): 775-799 (2021)
2010 – 2019
- 2019
- [c9]Antiopi Panteli, Basilis Boutsinas:
Improvement of similarity-diversity trade-off in recommender systems based on a facility location model. IISA 2019: 1-7 - 2014
- [j15]Antiopi Panteli, Basilis Boutsinas, Ioannis Giannikos:
On Set Covering Based on Biclustering. Int. J. Inf. Technol. Decis. Mak. 13(5): 1029-1050 (2014) - 2013
- [j14]Basilis Boutsinas:
Machine-part cell formation using biclustering. Eur. J. Oper. Res. 230(3): 563-572 (2013) - [j13]Basilis Boutsinas:
A New Biclustering Algorithm Based on Association Rule Mining. Int. J. Artif. Intell. Tools 22(3) (2013) - 2012
- [j12]Constantinos Halkiopoulos, Basilis Boutsinas:
Automatic Interactive Music Improvization Based on Data Mining. Int. J. Artif. Intell. Tools 21(4) (2012)
2000 – 2009
- 2009
- [j11]Nikolaos Mastrogiannis, Basilis Boutsinas, Ioannis Giannikos:
A method for improving the accuracy of data mining classification algorithms. Comput. Oper. Res. 36(10): 2829-2839 (2009) - [j10]Hara Kostakis, Basilis Boutsinas, Demosthenes B. Panagiotakos, Leo D. Kounis:
A computational algorithm for the risk assessment of developing acute coronary syndromes, using online analytical process methodology. Int. J. Knowl. Eng. Soft Data Paradigms 1(1): 85-99 (2009) - [j9]Nikolaos Mastrogiannis, Ioannis Giannikos, Basilis Boutsinas, Gerasimos Antzoulatos:
CL.E.KMODES: a modified k-modes clustering algorithm. J. Oper. Res. Soc. 60(8): 1085-1095 (2009) - [c8]Christos Tatsiopoulos, Basilis Boutsinas, Konstantinos Sidiropoulos:
On Aligning Interesting Parts of Ontologies. KEOD 2009: 363-367 - [c7]Christos Tatsiopoulos, Basilis Boutsinas:
Ontology Mapping based on Association Rule Mining. ICEIS (3) 2009: 33-40 - 2008
- [j8]Basilis Boutsinas, Costas Siotos, Antonis Gerolimatos:
Distributed Mining of Association Rules Based on Reducing the Support Threshold. Int. J. Artif. Intell. Tools 17(6): 1109-1129 (2008) - [j7]Basilis Boutsinas, S. Athanasiadis:
On Merging Classification Rules. Int. J. Inf. Technol. Decis. Mak. 7(3): 431-450 (2008) - [j6]Basilis Boutsinas, Thomas Papastergiou:
On clustering tree structured data with categorical nature. Pattern Recognit. 41(12): 3613-3623 (2008) - 2004
- [j5]Basilis Boutsinas, George Prassas, Gerasimos Antzoulatos:
A Methodology for Scaling up Classification Algorithms. Int. J. Artif. Intell. Tools 13(3): 623-640 (2004) - [c6]Basilis Boutsinas, Ioannis X. Tsekouronas:
Splitting Data in Decision Trees Using the New False-Positives Criterion. SETN 2004: 174-182 - 2003
- [c5]Dimitris K. Tasoulis, Panagiotis D. Alevizos, Basilis Boutsinas, Michael N. Vrahatis:
Parallel Unsupervised k-Windows: An Efficient Parallel Clustering Algorithm. PaCT 2003: 336-344 - 2002
- [j4]Basilis Boutsinas:
Accessing Data Mining Rules through Expert Systems. Int. J. Inf. Technol. Decis. Mak. 1(4): 657-672 (2002) - [j3]Michael N. Vrahatis, Basilis Boutsinas, Panagiotis D. Alevizos, Georgios Pavlides:
The New k-Windows Algorithm for Improving the k-Means Clustering Algorithm. J. Complex. 18(1): 375-391 (2002) - [j2]Basilis Boutsinas, T. Gnardellis:
On distributing the clustering process. Pattern Recognit. Lett. 23(8): 999-1008 (2002) - [c4]Adam V. Adamopoulos, Basilis Boutsinas, Michael N. Vrahatis, Photios A. Anninos:
Analysis of epileptic magnetoencephalogram dynamics through clustering algorithms. DSP 2002: 607-610 - [c3]Panagiotis D. Alevizos, Basilis Boutsinas, Dimitris K. Tasoulis, Michael N. Vrahatis:
Improving the Orthogonal Range Search k -Windows Algorithm. ICTAI 2002: 239-245 - 2001
- [j1]Basilis Boutsinas, Michael N. Vrahatis:
Artificial nonmonotonic neural networks. Artif. Intell. 132(1): 1-38 (2001)
1990 – 1999
- 1997
- [p1]Basilis Boutsinas, Yannis C. Stamatiou, Georgios Pavlides:
Massively parallel support for nonmonotonic reasoning. Parallel Processing for Artificial Intelligence 3 1997: 41-67 - 1996
- [c2]Basilis Boutsinas, Stergios Papadimitriou, Georgios Pavlides:
Automatic Analysis, Verification and Synthesis of Rule-Based Real-Time Decision Making Systems with Machine Learning Assistance. Ershov Memorial Conference 1996: 134-145 - [c1]Basilis Boutsinas:
On Managing Nonmonotonic Transitive Relationships. ICTAI 1996: 374-382
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-04-24 22:54 CEST 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:
