Deep Web Complex Schema Matching Based on Boolean Matrix

2011 
This paper introduces the Boolean matrix into the both positive and negative association rules,based on the Duel Correlated Mining (DCM) algorithm,it presents a Deep Web complex schema matching algorithm.It transforms the attributes in the query interface schemas into a Boolean matrix,mines group attributes by positively calculating for matrix and mines synonymous attributes by negatively calculating for matrix. Experimental results show that the algorithm has higher efficiency.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    4
    References
    0
    Citations
    NaN
    KQI
    []