Semantic text mining with linked data

NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC

Volumn , Issue , 2009, Pages 338-343

  Zhaohui, Huang ^a   Huajun, Chen ^a   Tong, Yu ^a   Hao, Sheng ^a   Luo, Zhaobo ^a   Yuxin, Mao ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG GONGSHANG UNIVERSITY   (China)

Author keywords

Entity extraction; Frequent subgraph; Linked data; Massive knowledge relation; Semantic graph; Semantic graph fusion

Indexed keywords

BIOLOGICAL NETWORKS; DATA SPACE; DISCOVERY ALGORITHM; FREQUENT PATTERNS; FREQUENT SUBGRAPHS; LINKED DATA; RELATION SEMANTICS; SEMANTIC ANNOTATIONS; SEMANTIC GRAPHS; SEMANTIC RELATIONS; SEMANTIC WEB TECHNOLOGY; STRUCTURED DATA; TERRORIST NETWORKS; TEXT MINING; TEXTUAL DOCUMENTS;

ELECTRIC NETWORK ANALYSIS; INFORMATION MANAGEMENT; SEMANTIC WEB; SEMICONDUCTOR STORAGE; WORLD WIDE WEB;

SEMANTICS;

EID: 73549125476     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCM.2009.131     Document Type: Conference Paper

References (14)

1. T. Berners-Lee, J. Hendler, and O. Lassila, "Semantic Web", Scientific Am., vol. 284, no.5, pp.35-43, 2001
2. W3C, W3c RDF Specification, http://www.w3.org/RDF/,2005.
3. W3C, W3c, RDF Schema Specification, http://www.w3.org/TR/rdfschema/, 2005
4. W3C,W3c, Web Ontology Language, http://www.w3.org/2004/OWL/
5. Chris Bizer, Richard Cyganniak, Tom Heath. "How to Publish Linked Data on the Web." http://www4.wiwiss.fuberlin.de/bizer/pub/ LinkedDataTutorial/.
6. J.D. Holt and S.M. Chung, "Multipass Algorithms for Mining Association Rules in Text Databases," Knowledge information System, vol.3, no.2, pp. 168-183, 2001.
7. Tao Jiang, Ah-Hwee Tan, and Ke Wang, "Mining Generalized Associations of Semantic Relations from Textual Web Content". Ieee Transations on Knowledge and Data Engineering, vol.19, no.2, February 2007.
8. Inokuchi A, Washio T, Okada T. ??An apriori-based algorithm for mining frequent substuctures from graph data." Proc. Of the PKDD 2000. Lnai 1910,2000. 13-23. http://eric.univ-lyon2.fr/-pkdd2000/.
9. Kuramochi M, Karypis G. "Frequent subgraph discovery," Proc. Of the ICDM 2001.2001. http://www.cs.york.ac.uk/arch/neural/Conferences/ICDM2001. html.
10. Yan Y.Han J. "gSpan: Graph-Based substructure pattern mining." Proc.of the 2002 Int'l Conf. on Data Mining (ICDM 2002). Maebashi, 2002. http://www.wi-lab.com/icdm02/
11. Yan X, Han J. "CloseGraph: Mining closed frequent graph patterns." Proc. of the 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining KDD2003. Washinton, 2003. http://www.sigkdd.org/kdd2003/
12. Han J, Wang W, Prins J. "Efficient mining of frequent subgraphs in the presence of isomorphism." Proc. of the IEEE Int'l Conf. on Data Mining (ICDM 2003), 2003. http://www.cs.sjsu.edu/faculty/tylin/icdm2003-workshop.htm
13. Li XT, Li JZ, Gao H. "An Efficient Frequent Subgraph Mining Algorithm." Journal of Software (China), 2007, http://www.jos.org.cn/100- 9825/18/2469.htm.
14. W3C. Tim Berners-Lee "Linked Data Design Issues" http://www.w3.org/DesignIssues/LinkedData.html. 2007.