EDBT 2026 Demo / reviewers in the wild / expert
Gianpiero Bianchi
dblp:143/4187
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › predictive modeling
classification |
0.2 | 1 | 2015 | Effective Classification Using a Small Training Set Based on Discretization and Statistical Analysis · IEEE Trans. Knowl. Data Eng. 2015 |
Data mining › predictive modeling › classification › rule learning
logical analysis of data |
0.2 | 1 | 2015 | Effective Classification Using a Small Training Set Based on Discretization and Statistical Analysis · IEEE Trans. Knowl. Data Eng. 2015 |
Methods — techniques the papers use, named apart from their topics
support vector machine · 0.2statistical analysis · 0.2label propagation · 0.2discretization · 0.2discrete optimization · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Website categorization: A formal approach and robustness analysis in the case of e-commerce detection
Renato Bruni, Gianpiero Bianchi |
Expert Syst. Appl. | 2 |
| 2015 | Effective Classification Using a Small Training Set Based on Discretization and Statistical AnalysisabstractThis work deals with the problem of producing a fast and accurate data classification, learning it from a possibly small set of records that are already classified. The proposed approach is based on the framework of the so-called Logical Analysis of Data (LAD), but enriched with information obtained from statistical considerations on the data. A number of discrete optimization problems are solved in the different steps of the procedure, but their computational demand can be controlled. The accuracy of the proposed approach is compared to that of the standard LAD algorithm, of support vector machines and of label propagation algorithm on publicly available datasets of the UCI repository. Encouraging results are obtained and discussed. Renato Bruni, Gianpiero Bianchi |
IEEE Trans. Knowl. Data Eng. | 2 |