The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Partial multi-dividing ontology learning algorithm
Abstract
Abstract As an effective data representation, storage, management, calculation and model for analysis, ontology has attracted more and more attention by researchers and it has been applied to various engineering disciplines. In the background of big data, the ontology is expected to increase the amount of data information and the structure of its corresponding ontology graph has become more important due to its complexity. It demands that the ontology algorithm must be more efficient than before. In a specific engineering application, the ontology algorithm is required to find in a quick way the semantic matching set of the concept and rank it back to the user according to their similarities. Therefore, to use learning tricks to get better ontology algorithms is an open problem nowadays. The aim of the present paper is to present a partial multi–dividing ontology algorithm with the aim of obtaining an efficient approach to optimize the partial multi–dividing ontology learning model. For doing it we state several theoretical results from a statistical learning theory perspective. Moreover, we present five experiments in different engineering fields to show the precision of our partial multi-dividing algorithm from angles of ontology, similarity measuring and ontology mapping building point of view.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Clinical Diagnostics in Human Genetics with Semantic Similarity Searches in Ontologies
Köhler, S., Schulz, M. H., Krawitz, P., Bauer, S., Dölken, S., Ott, C. E., Mundlos, C., Horn, D., Mundlos, S., & Robinson, P. N. (2009) · The American Journal of Human Genetics · doi:10.1016/j.ajhg.2009.09.003 · Cited by 590
Cited by
Slime mould algorithm: A new method for stochastic optimization
Li, S., Chen, H., Wang, M., Heidari, A. A., & Mirjalili, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.03.055 · Cited by 3,036
Application of deep learning algorithms in geotechnical engineering: a short critical review
Zhang, W., Li, H., Li, Y., Liu, H., Chen, Y., & Ding, X. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-021-09967-1 · Cited by 538
Chen, H., Heidari, A. A., Chen, H., Wang, M., Pan, Z., & Gandomi, A. H. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.04.008 · Cited by 322
Chen, H., Jiao, S., Heidari, A. A., Wang, M., Chen, X., & Zhao, X. (2019) · Energy Conversion and Management · doi:10.1016/j.enconman.2019.05.057 · Cited by 287
Metadata
- Authors
- Gao, W., L.G. Guirao, J., Basavanagoud, B., & Wu, J.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2018-10
- Volume
- 467
- Pages
- 35-58
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2884377959
- Cited by
- 189
- References
- 1
- FWCI
- 23.91
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Partial multi-dividing ontology learning algorithm. https://app.cochat.ai/papers/10.1016/j.ins.2018.07.049
- The paper
- Gao, W., L.G. Guirao, J., Basavanagoud, B., & Wu, J. (2018). Partial multi-dividing ontology learning algorithm. Information Sciences. https://doi.org/10.1016/j.ins.2018.07.049
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.