default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Mola
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Maurizio Romano
, Giulia Contu, Francesco Mola, Claudio Conversano:
Threshold-based Naïve Bayes classifier. Adv. Data Anal. Classif. 18(2): 325-361 (2024)- [i2]Salvatore M. Carta, Stefano Chessa, Giulia Contu, Andrea Corriga, Andrea Deidda, Gianni Fenu, Luca Frigau, Alessandro Giuliani, Luca Grassi, Marco Manolo Manca, Mirko Marras, Francesco Mola, Bastianino Mossa, Piergiorgio Mura, Marco Ortu, Leonardo Piano, Simone Pisano, Alessia Pisu, Alessandro Sebastian Podda, Livio Pompianu, Simone Seu, Sandro Gabriele Tiddia:
LIMBA: An Open-Source Framework for the Preservation and Valorization of Low-Resource Languages using Generative Models. CoRR abs/2411.13453 (2024) - 2021
- [j5]Gianpaolo Zammarchi, Luca Frigau, Francesco Mola:
Markov chain to analyze web usability of a university website using eye tracking data. Stat. Anal. Data Min. 14(4): 331-341 (2021) - [i1]Gianpaolo Zammarchi, Francesco Mola, Claudio Conversano:
Impact of the COVID-19 outbreak on Italy's country reputation and stock market performance: a sentiment analysis approach. CoRR abs/2103.13871 (2021) - 2020
- [j4]Farideh Tavazoee, Claudio Conversano, Francesco Mola:
Recurrent random forest for the assessment of popularity in social media. Knowl. Inf. Syst. 62(5): 1847-1879 (2020)
2010 – 2019
- 2019
- [j3]Claudio Conversano, Massimo Cannas, Francesco Mola, Emiliano Sironi:
Random effects clustering in multilevel modeling: choosing a proper partition. Adv. Data Anal. Classif. 13(1): 279-301 (2019) - 2017
- [c7]Farideh Tavazoee, Claudio Conversano, Francesco Mola:
Investigating the Relationship Between Tweeting Style and Popularity: The Case of US Presidential Election 2016. KESW 2017: 112-123 - 2014
- [c6]Luca Frigau, Claudio Conversano, Francesco Mola:
Assessing the Reliability of a Multi-Class Classifier. ECDA 2014: 207-217
2000 – 2009
- 2002
- [c5]Massimo Aria, Francesco Mola, Roberta Siciliano:
Growing and Visualizing Prediction Paths Trees in Market Basket Analysis. COMPSTAT 2002: 377-382 - [c4]Francesco Mola, Roberta Siciliano:
Discriminant Analysis and Factorial Multiple Splits in Recursive Partitioning for Data Mining. Multiple Classifier Systems 2002: 118-126 - 2001
- [j2]Claudio Conversano, Francesco Mola, Roberta Siciliano:
Partitioning Algorithms and Combined Model Integration for Data Mining. Comput. Stat. 16(3): 323-339 (2001) - 2000
- [c3]Claudio Conversano, Roberta Siciliano, Francesco Mola:
Supervised Classifier Combination through Generalized Additive Multi-model. Multiple Classifier Systems 2000: 167-176
1990 – 1999
- 1998
- [c2]Carmela Cappelli, Francesco Mola, Roberta Siciliano:
An Alternative Pruning Method Based on the Impurity-Complexity Measure. COMPSTAT 1998: 221-226 - [c1]Jan Klaschka, Francesco Mola:
Minimization of Computational Cost in Tree-Based Methods by a Proper Ordering of Splits. COMPSTAT 1998: 359-364 - 1997
- [j1]Francesco Mola, Roberta Siciliano:
A fast splitting procedure for classification trees. Stat. Comput. 7(3): 209-216 (1997)
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 2025-01-21 00:24 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:
