tailieunhanh - Managing and Mining Graph Data part 9

Managing and Mining Graph Data part 9 is a comprehensive survey book in graph data analytics. It contains extensive surveys on important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy. It also studies a number of domain-specific scenarios such as stream mining, web graphs, social networks, chemical and biological data. The chapters are written by leading researchers, and provide a broad perspective of the area. This is the first comprehensive survey book in the emerging topic of graph data processing. . | Graph Data Management and Mining A Survey of Algorithms and Applications 61 91 Si. Harris N. Gibbins. Efficient bulk RDF storage. In PSSS Conference 20003. 92 Hi. Harris. N. ShadholL SPARQL query processing with conventional relational database eys terns. In SSWS Conference 20005. 33 M. Al Haoans V. Chaoji Si. Salem J. Besson M. J. Zaki. ORIGAMI Mining Representative Orthogonal Graph Patterns. ICDM Conference 20007. 94 D. Hausslct. kernel. on discrete structures. Technical Report UCSC-CRL-99-10 University of California Santa Cruz 1999. 95 T. Haveliwala. TopiCiSensitive Page Rank HW Wide Web Conference 20002. 96 H Ide A. K. Singh. Query Language and Access Methods for Graph Database appcatn as a chapter in Managing and Mining Graph Data ed. Sharu Aggarwal Springer 20010. 97 H. HCi Querying and mimng graph databases. . Thesis UCSB 20007. 88 H Ide A. K. Singlt. Ftiicicnt Algoriihms for Mining Significant Substructures iriivn Grarhs with Quality Guarantees. ICDM Conference 20007. 99 H. Illi H. Yang. J. Yang P S. Yu. BRISKS Ranked keyword searches on gaaphs. SIGMOD Conference 20007. 100 J. Huan W. Wang. J. Prins. J. Yang. Spin Mining Maximal Frequent Subgraphs faom Graph Databases. PDD Conference 20004. 1 F1 J. Huan IV. Wang. D. Bandyopadhyay. J. Snoeyink J. Prins A. Trop-shai Mining Sputiai Moths from Paotein Structure Graphs. Research in Somputational Molecular Biology RECOMB ftp. dOS-d 15. 2004. 102 it. Hristiaiis. N. Koudas Y. liitsivtlsimiitantinoii. D. Srivastava. Keyword . search in XML trees. IEEE Transactions on Knowledge and Data Engineering 18 4 525-539 2006. 103 it. HristidiSi tie PapakonstantinoiL Discover Keyword search in rela-tionai iS l es. VLDB Conference 200202. 104I A. In T. Washio H. Motoda. fin Apriori-based Algorithm for Mini ng Frequent Substructures from Graph Data. PKDD Conference 3-23. 2000. 105 H. V. Jagasiish A cornpresnion technique to materialize transitive closure. SPM Trans. Datab as e Sy

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.