메뉴 건너뛰기




Volumn 5463, Issue , 2009, Pages 714-729

In the search of NECTARs from evolutionary trees

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY TREE; REAL APPLICATIONS; SELECTIVITY ESTIMATION; SEMI STRUCTURED DATA; STRUCTURAL CHANGE; SUBTREE; SUBTREES; TREE DATA; TREE-STRUCTURED DATA; WEB MINING; XML PATH;

EID: 67650105521     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_62     Document Type: Conference Paper
Times cited : (2)

References (17)
  • 2
    • 4544334171 scopus 로고    scopus 로고
    • Efficient substructure discovery from large semi-structured data
    • Asai, T., Abe, K., et al.: Efficient Substructure Discovery from Large Semi-structured Data. In: SIAM DM (2002)
    • (2002) SIAM DM
    • Asai, T.1    Abe, K.2
  • 3
    • 67650134894 scopus 로고    scopus 로고
    • Mining association rules from xml data
    • Braga, D., Campi, A., Ceri, S., et al.: Mining Association Rules from XML Data. In: DAWAK (2000)
    • (2000) DAWAK
    • Braga, D.1    Campi, A.2    Ceri, S.3
  • 4
    • 0031161999 scopus 로고    scopus 로고
    • Beyond market baskets: Generalizing association rules to correlations
    • Brin, S., Motwani, R., Silverstein, C.: Beyond Market Baskets: Generalizing Association Rules to Correlations. In: SIGMOD (1997)
    • (1997) SIGMOD
    • Brin, S.1    Motwani, R.2    Silverstein, C.3
  • 5
    • 0031167952 scopus 로고    scopus 로고
    • Meaningful change detection in structured data
    • Chawathe, S., Garcia-Molina, H.:Meaningful Change Detection in Structured Data. In: SIGMOD (1997)
    • (1997) SIGMOD
    • Chawathe, S.1    Garcia-Molina, H.2
  • 6
    • 33748150390 scopus 로고    scopus 로고
    • FRACTURE mining: Mining frequently and concurrently mutating structures from historical XML documents
    • DOI 10.1016/j.datak.2005.09.002, PII S0169023X05001448, Sixth ACM International Workshop on WEb Information and Data Management
    • Chen, L., Bhowmick, S.S., Chia, L.T.: FRACTURE Mining: Mining Frequently and Concurrently Mutating Structures from Historical XML Documents. Data and Knowl. Eng. 59, 320-347 (2006) (Pubitemid 44311222)
    • (2006) Data and Knowledge Engineering , vol.59 , Issue.2 , pp. 320-347
    • Chen, L.1    Bhowmick, S.S.2    Chia, L.-T.3
  • 7
    • 35348821234 scopus 로고    scopus 로고
    • Mirror site maintenance based on evolution associations of web directories
    • Chen, L., Bhowmick, S.S., Nejdl,W.:Mirror Site Maintenance Based on Evolution Associations of Web Directories. In: ACMWWW, Banff, Canada, Techical report (2007), http://www.cais.ntu.edu.sg/~assourav/TechReports/NEAR-TR.pdf
    • (2007) ACMWWW, Banff, Canada, Techical report
    • Chen, L.1    Bhowmick, S.S.2    Nejdl, W.3
  • 10
    • 0742268827 scopus 로고    scopus 로고
    • An efficient and scalable algorithm for clustering xml documents by structure
    • Lian, W., Cheung, D.W., Mamoulis, N., Yiu, S.M.: An Efficient and Scalable Algorithm for Clustering XML Documents by Structure. IEEE TKDE, vol. 16(1) (2004)
    • (2004) IEEE TKDE , vol.16 , Issue.1
    • Lian, W.1    Cheung, D.W.2    Mamoulis, N.3    Yiu, S.M.4
  • 12
    • 0344927764 scopus 로고    scopus 로고
    • X-diff: An effective change detection algorithm for xml documents
    • Wang, Y., DeWitt, D.J., et al.: X-diff: An Effective Change Detection Algorithm for XML Documents. In: ICDE (2003)
    • (2003) ICDE
    • Wang, Y.1    DeWitt, D.J.2
  • 13
    • 33745626314 scopus 로고    scopus 로고
    • Bloom histogram: Path selectivity estimation for xml data with updates
    • Wang,W., Jiang, H., et al.: Bloom Histogram: Path Selectivity Estimation for XML Data with Updates. In: VLDB (2004)
    • (2004) VLDB
    • Wang, W.1    Jiang, H.2
  • 14
    • 3042700702 scopus 로고    scopus 로고
    • Mining both positive and negative association rules
    • Wu, X., Zhang, C., Zhang, S.: Mining both Positive and Negative Association Rules. In: ICML (2002)
    • (2002) ICML
    • Wu, X.1    Zhang, C.2    Zhang, S.3
  • 15
    • 0242709382 scopus 로고    scopus 로고
    • Efficiently mining frequent trees in a forest
    • Zaki, M.J.: Efficiently Mining Frequent Trees in a Forest. In: SIGKDD (2002)
    • (2002) SIGKDD
    • Zaki, M.J.1
  • 16
    • 77952397753 scopus 로고    scopus 로고
    • XRules: An effective structural classifier for xml data
    • Zaki, M.J., Aggarwal, C.C.: XRules: An Effective Structural Classifier for XML Data. In: SIGKDD (2003)
    • (2003) SIGKDD
    • Zaki, M.J.1    Aggarwal, C.C.2
  • 17
    • 83255190853 scopus 로고    scopus 로고
    • Discovering frequently changing structures from historical structural deltas of unordered xml
    • Zhao, Q., Bhowmick, S.S., Mohania, M., Kambayashi, Y.: Discovering Frequently Changing Structures from Historical Structural Deltas of Unordered XML. In: ACM CIKM (2004)
    • (2004) ACM CIKM
    • Zhao, Q.1    Bhowmick, S.S.2    Mohania, M.3    Kambayashi, Y.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.