The control of structured matching in knowledge base. Dulin, S. & Kiselev, I. Izvestiya Akademii Nauk: Tekhnicheskaia Kibernetika, 1991. cited By 0
Paper abstract bibtex The paper deals with the problem of modelling of structured dismasting in knowledge base with the help of sign matrix of cohesiveness. The algorithm of dismatching decreasing is constructed. The matching forming of knowledge system in the process of knowledge acquisition is a very actual problem. Both semantic and structural matching are analyzed. One of the central questions of structured matching analysis is the choice of matching criterion. Evaluation of contents of knowledge base is discussed. Particularly, for solution of this problem authors propose to use the notions of conceptual clustering such as conceptual cohesiveness. The description of the methods and algorithms which have been designed in system 'Disson' is given.
@ARTICLE{Dulin199129,
author={Dulin, S.K. and Kiselev, I.A.},
title={The control of structured matching in knowledge base},
journal={Izvestiya Akademii Nauk: Tekhnicheskaia Kibernetika},
year={1991},
number={5},
pages={29-39},
note={cited By 0},
url={https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026226101&partnerID=40&md5=a9aff1e7fcdebdebb7b9de2e00b78a73},
abstract={The paper deals with the problem of modelling of structured dismasting in knowledge base with the help of sign matrix of cohesiveness. The algorithm of dismatching decreasing is constructed. The matching forming of knowledge system in the process of knowledge acquisition is a very actual problem. Both semantic and structural matching are analyzed. One of the central questions of structured matching analysis is the choice of matching criterion. Evaluation of contents of knowledge base is discussed. Particularly, for solution of this problem authors propose to use the notions of conceptual clustering such as conceptual cohesiveness. The description of the methods and algorithms which have been designed in system 'Disson' is given.},
correspondence_address1={Dulin, S.K.},
coden={IATKA},
language={Russian},
abbrev_source_title={Izv Akad Nauk Teh Kibern},
document_type={Article},
source={Scopus},
}
Downloads: 0
{"_id":"JLwaiAMtWeTiYwzHs","bibbaseid":"dulin-kiselev-thecontrolofstructuredmatchinginknowledgebase-1991","author_short":["Dulin, S.","Kiselev, I."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Dulin"],"firstnames":["S.K."],"suffixes":[]},{"propositions":[],"lastnames":["Kiselev"],"firstnames":["I.A."],"suffixes":[]}],"title":"The control of structured matching in knowledge base","journal":"Izvestiya Akademii Nauk: Tekhnicheskaia Kibernetika","year":"1991","number":"5","pages":"29-39","note":"cited By 0","url":"https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026226101&partnerID=40&md5=a9aff1e7fcdebdebb7b9de2e00b78a73","abstract":"The paper deals with the problem of modelling of structured dismasting in knowledge base with the help of sign matrix of cohesiveness. The algorithm of dismatching decreasing is constructed. The matching forming of knowledge system in the process of knowledge acquisition is a very actual problem. Both semantic and structural matching are analyzed. One of the central questions of structured matching analysis is the choice of matching criterion. Evaluation of contents of knowledge base is discussed. Particularly, for solution of this problem authors propose to use the notions of conceptual clustering such as conceptual cohesiveness. The description of the methods and algorithms which have been designed in system 'Disson' is given.","correspondence_address1":"Dulin, S.K.","coden":"IATKA","language":"Russian","abbrev_source_title":"Izv Akad Nauk Teh Kibern","document_type":"Article","source":"Scopus","bibtex":"@ARTICLE{Dulin199129,\r\nauthor={Dulin, S.K. and Kiselev, I.A.},\r\ntitle={The control of structured matching in knowledge base},\r\njournal={Izvestiya Akademii Nauk: Tekhnicheskaia Kibernetika},\r\nyear={1991},\r\nnumber={5},\r\npages={29-39},\r\nnote={cited By 0},\r\nurl={https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026226101&partnerID=40&md5=a9aff1e7fcdebdebb7b9de2e00b78a73},\r\nabstract={The paper deals with the problem of modelling of structured dismasting in knowledge base with the help of sign matrix of cohesiveness. The algorithm of dismatching decreasing is constructed. The matching forming of knowledge system in the process of knowledge acquisition is a very actual problem. Both semantic and structural matching are analyzed. One of the central questions of structured matching analysis is the choice of matching criterion. Evaluation of contents of knowledge base is discussed. Particularly, for solution of this problem authors propose to use the notions of conceptual clustering such as conceptual cohesiveness. The description of the methods and algorithms which have been designed in system 'Disson' is given.},\r\ncorrespondence_address1={Dulin, S.K.},\r\ncoden={IATKA},\r\nlanguage={Russian},\r\nabbrev_source_title={Izv Akad Nauk Teh Kibern},\r\ndocument_type={Article},\r\nsource={Scopus},\r\n}\r\n\r\n","author_short":["Dulin, S.","Kiselev, I."],"key":"Dulin199129","id":"Dulin199129","bibbaseid":"dulin-kiselev-thecontrolofstructuredmatchinginknowledgebase-1991","role":"author","urls":{"Paper":"https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026226101&partnerID=40&md5=a9aff1e7fcdebdebb7b9de2e00b78a73"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bio.pnpi.nrcki.ru/wp-content/uploads/2019/12/lbm_2019_10.txt","dataSources":["YYLjupmCazkNqWNEJ"],"keywords":[],"search_terms":["control","structured","matching","knowledge","base","dulin","kiselev"],"title":"The control of structured matching in knowledge base","year":1991}