Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
ALGORITEM ZA UGOTAVLJANJE IN RAZREŠITEV CIKLOV V TAKSONOMIJAH POMENSKIH GRAFOV
Authors:
ID
Zabreznik, Marko
(
Author
)
ID
Ojsteršek, Milan
(
Mentor
)
More about this mentor...
Files:
UNI_Zabreznik_Marko_2013.pdf
(16,81 MB)
MD5: 5F076672468317751E2181CB7B452A82
Language:
Slovenian
Work type:
Bachelor thesis/paper
Typology:
2.11 - Undergraduate Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
Abstract:
Pomenska mreža je model predstavitve človeškega znanja v računalniških sistemih. Pridobivanje podatkov za takšno mrežo poteka z uporabo algoritmov za odkrivanje znanja v besedilih ali pa jih vnaša človek, z avtoriteto na domensko specifičnem področju. Pri vnosih lahko pride do napak. V delu smo analizirali stanje na področju javno dostopnih baz znanja. Za izbrano bazo znanja smo uporabili primerno podatkovno strukturo. Izdelali smo nabor algoritmov za manipulacijo z grafi, ter implementirali Tarjanov algoritem za iskanje močno povezanih komponent. Najdene cikle smo označili in jih odstranili.
Keywords:
pomenska mreža
,
taksonomije
,
pomenski graf
,
SCC
Place of publishing:
[Maribor
Publisher:
[M. Zabreznik]
Year of publishing:
2013
PID:
20.500.12556/DKUM-42138
UDC:
004.6:004.92(043.2)
COBISS.SI-ID:
17528598
NUK URN:
URN:SI:UM:DK:UJ7XOMJ0
Publication date in DKUM:
20.09.2013
Views:
1398
Downloads:
187
Metadata:
Categories:
KTFMB - FERI
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Secondary language
Language:
English
Title:
ALGORITHM FOR IDENTIFICATION AND RESOLUTION OF CYCLES IN TAXONOMIES OF SEMANTIC GRAPHS
Abstract:
A semantic network is a model used to represent human knowledge in computer systems. Data acquisition for such networks is based on algorithms for detecting knowledge in texts or with experts with authority on domain specific fields. In this work we analyzed the state of publicly available knowledge databases. We used a suitable data structure for our chosen database then implemented a set of algorithms for manipulation of graph data. We implemented Tarjan’s strongly connected components algorithm and marked the resulting cycles and removed them.
Keywords:
semantic network
,
taxonomies
,
semantic graph
,
SCC
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
