From Data and Information Analysis to Knowledge Engineering
DOI: 10.1007/3-540-31314-1_49
|View full text |Cite
|
Sign up to set email alerts
|

Towards Structure-sensitive Hypertext Categorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…Let be a network, and be a graph distance measure. Having a set of networks , the graph prototype can be expressed by [21] , [23] , [45] : We see that in Eq. 1 gives the mean distance from network to all other networks in .…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Let be a network, and be a graph distance measure. Having a set of networks , the graph prototype can be expressed by [21] , [23] , [45] : We see that in Eq. 1 gives the mean distance from network to all other networks in .…”
Section: Methodsmentioning
confidence: 99%
“…This is another strong-point of this method, as it can be modified to make use of other, customized graph distance measures. To demonstrate the selection of a graph prototype [21] , [23] we make use of prostate cancer gene expression studies. 25% of newly diagnosed male cancers in the US are prostate cancers [24] , which makes it an attractive target for ongoing biomedical research.…”
Section: Introductionmentioning
confidence: 99%
“…However, note that the problem of mapping web pages or websites to graphs is not unique and several methods have been proposed to do so [31,55]. After deriving the hypertext graphs, concrete problems to use this apparatus would involve investigating navigational paths induced by different learners.…”
Section: Assessmentmentioning
confidence: 99%
“…Also the measures could be used to determine graph isomorphism efficiently with low error rate and to classify graphs. We note that graph classification has been intricate towards large sets of graphs, see, e.g., [40][41][42].…”
Section: Introductionmentioning
confidence: 99%