Kazem Taghandiky- M.Sc
- Research Assistant at University of Isfahan
Kazem Taghandiky
- M.Sc
- Research Assistant at University of Isfahan
About
8
Publications
25,857
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
11
Citations
Introduction
He lives in South Khorasan, and born in Birjand city.
B.Sc From University of Birjand. (2010-2013).
And now,He is M.Sc student of Software Engineering at University of Isfahan(start at 2013.)
His Thesis is "Implementation of a Removal System for Noisy Hyperlinks Using Semantic and Relatedness Approach".
you can Communicate with me ّfrom the following methods:
Email1: taghandiky@gmail.com
Email2: taghandiky@eng.ui.ac.ir
Tel:+98 933 581 62 44.
Current institution
Additional affiliations
January 2013 - February 2015
Publications
Publications (8)
String distance” redirects here. For the distance between strings and the fingerboard in musical instruments,
see Action (music)
It will not take a longtime that the human will
apply the networks of sensors in controlling the environment and
predict natural disasters. This vast function would create bulks of
sensor data to be applied World Wide Web. These bulks of data
should be handled and processed a primary manner, which is a
difficult task; therefore only the expert in t...
Semantic similarity or semantic relatedness is a metric defined over a set of documents or terms, where the idea of distance between them is based on the likeness of their meaning or semantic content as opposed to similarity which can be estimated regarding their syntactical representation (e.g. their string format). These are mathematical tools us...
اولین همایش ملی مهندسی برق و کامپیوتر در شمال کشور
A very large database, or VLDB, is a database that contains an extremely high number of tuples (database rows), or occupies an extremely large physical file system storage space. The most common definition of VLDB is a database that occupies more than 1 terabyte or contains several billion rows, although naturally this definition changes over time.
Questions
Questions (22)
Hello
Does anyone know, how much time does article editing(first revision) and publishing take at last from Journal of Web Engineering (JWE)?
In the site, there is no information about it.
They also do not respond e-mail.
thank you
how i can start a reasoner on dbpedia owl in jena library in order to Diagnosis disjointwith classes.
Semantic Similarity criteria based on Wordnet:
1- lin
Math equation is modified a little bit from Jiang and Conrath: 2 * IC(lcs) / (IC(synset1) + IC(synset2)). Where IC(x) is the information content of x. One can observe, then, that the relatedness value will be greater-than or equal-to zero and less-than or equal-to one.
2-RES
Resnik defined the similarity between two synsets to be the information content of their lowest super-ordinate (most specific common subsumer)
3-LCH
This measure relies on the length of the shortest path between two synsets for their measure of similarity. They limit their attention to IS-A links and scale the path length by the overall depth D of the taxonomy
4-Path
5-WUP
The Wu & Palmer measure calculates relatedness by considering the depths of the two synsets in the WordNet taxonomies, along with the depth of the LCS
noisy links that Conduct user to false target.
more help:
I mean
Links that are in about a special concept
But when the user encounters with concept destination page.
Discover that the two concepts are different.
-----------------------------------------
for example:
Fruit (concept Hyperlink context) -------------> machine (concept target page)
Can anyone recommend a site with many noisy links?
I want to know sites that have noisy link.
But do not know if the version I downloaded contains only the Ontology Sumo or other manufacturer's components like Dbpedia, FOAF and other Ontologies that are in sumo.
download sumo ontology from this link: http://www.adampease.org/OP/SUMO.owl
size: 35.1 m
SUMO OWL=(T-Box)+(A-Box)
but, i want only T-box
