Making Use of Empty Intersections to Improve the Performance of CbO-Type Algorithms
- Submitting institution
-
Sheffield Hallam University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1359
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-59271-8_4
- Title of conference / published proceedings
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- First page
- 56
- Volume
- 10308
- Issue
- 10308
- ISSN
- 0302-9743
- Open access status
- Not compliant
- Month of publication
- May
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The In-Close algorithm is widely recognised as world leading. Janostik et al. (2021) adopted pruning features of In-Close for their algorithm for the computation of the Duquenne-Guigues basis. Veroneze & Von Zuben (2021) added online partitioning to In-Close, widening its applicability to real-number and multi-valued data sets. Konecny & Krajča (2020) improved scalability by proposing several parallel and distributed algorithms based on In-Close. Mishra et al. (2020) used In-Close to identify most the influential node in a terrorist network. The open-source implementation of In-Close has been downloaded 2485 times.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -