You have already added 0 works in your ORCID record related to the merged Research product.
You have already added 0 works in your ORCID record related to the merged Research product.
Beyond Screenshots: Machine-Actionable, Canonical, Semantic Citation of Graphed Data
Beyond Screenshots: Machine-Actionable, Canonical, Semantic Citation of Graphed Data
In 2016 and 2017, a series of conferences for European philologists was organized around the question, “What digital services, collections or curricula need to be developed so that a field of study can flourish in a digital society?” This paper argues for the need to cite graphs of data with machine-actionable canonical citation, independently of the data organized by a graph. It describes ongoing work to implement a “Canonical Graph Service” into the CITE/CTS framework used by the Homer Multitext (HMT). It describes citation of graphs, parts of graphs, and sub-graphs by URN, with some examples of how such URN citations might usefully be resolved. Finally, I discuss the limits of this approach, problems that will not be solved by a Canonical Graph Service. This approach may facilitate the creation of generic tools for documenting syntax across languages, integrating data from diverse projects, and opening new areas of research to scholars outside of quantitative fields.
Digital Classics Online, Bd. 3,3 (2017)
Library of Congress Subject Headings: lcsh:Ancient history lcsh:C lcsh:D51-90 lcsh:Auxiliary sciences of history
Digital Humanities, Syntax, Greek, Graphs, Graphs; Syntax; Digital Humanities; Greek
Digital Humanities, Syntax, Greek, Graphs, Graphs; Syntax; Digital Humanities; Greek
Library of Congress Subject Headings: lcsh:Ancient history lcsh:C lcsh:D51-90 lcsh:Auxiliary sciences of history
1512
16 See, for example, Fuhao & Jiping (2009); Noto & Satox (2000).
17 It may be impossible to isolate all possible paths between two objects in a graph algorithmically, since this problem is “NP-Hard”. See Knuth (1974).
Almas, B. and Beaulieu M.-C., “Developing a New Integrated Editing Platform for Source Documents in Classics,” Literary and linguistic computing, vol. 28, no. 4, pp. 493-503, 2013.
Fuhao, Z., and Jiping L., “An Algorithm of Shortest Path Based on Dijkstra for Huge Data.” In 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, 4:244-47, 2009. doi:10.1109/FSKD.2009.848. [OpenAIRE]
Fuhao, Z., and Jiping L., “An Algorithm of Shortest Path Based on Dijkstra for Huge Data.” In 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, 4:244-47, 2009. doi:10.1109/FSKD.2009.848. [OpenAIRE]
Guha, R. V., and Vineet Gupta. “Communicating Semantics: Reference by Description,” 2015.
https://research.google.com/pubs/pub44679.html.
Howard, V.A., “On Musical Quotation”, Monist 58 (1974) 310.
Knuth, D. E., “Postscript About NP-Hard Problems.” SIGACT News 6, no. 2 (April 1974): 15-16. doi:10.1145/1008304.1008305.
Mambrini F., “Thucydides 1.89-1.118: A Multi-layer Treebank.,” CHS Research Bulletin, vol.
- 1
- 2
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Popularity provided by BIP!In 2016 and 2017, a series of conferences for European philologists was organized around the question, “What digital services, collections or curricula need to be developed so that a field of study can flourish in a digital society?” This paper argues for the need to cite graphs of data with machine-actionable canonical citation, independently of the data organized by a graph. It describes ongoing work to implement a “Canonical Graph Service” into the CITE/CTS framework used by the Homer Multitext (HMT). It describes citation of graphs, parts of graphs, and sub-graphs by URN, with some examples of how such URN citations might usefully be resolved. Finally, I discuss the limits of this approach, problems that will not be solved by a Canonical Graph Service. This approach may facilitate the creation of generic tools for documenting syntax across languages, integrating data from diverse projects, and opening new areas of research to scholars outside of quantitative fields.
Digital Classics Online, Bd. 3,3 (2017)