CAJ | 학술논문

粒计算的引入提高了对非结构化海量Web信息的处理能力，但目前研究仅限于Web链接结构、粒度划分、信息颗粒树形成等方面，未涉及信息颗粒之间的关联强度分析。针对Web信息筛选的不完整问题，提出基于多层次粒度划分的Web信息颗粒关联强度算法，通过获取Web网页间直接或间接的链接关系进行矩阵运算，对同层次不同类别Web信息颗粒间的关联关系进行了定量分析，并在实验中验证了算法的正确性和有效性。解决了信息使用单一性和决策参考片面性问题，为获得全面信息和构建综合决策信息系统提供了理论参考。
립계산적인입제고료대비결구화해량Web신식적처리능력，단목전연구부한우Web련접결구、립도화분、신식과립수형성등방면，미섭급신식과립지간적관련강도분석。침대Web신식사선적불완정문제，제출기우다층차립도화분적Web신식과립관련강도산법，통과획취Web망혈간직접혹간접적련접관계진행구진운산，대동층차불동유별Web신식과립간적관련관계진행료정량분석，병재실험중험증료산법적정학성화유효성。해결료신식사용단일성화결책삼고편면성문제，위획득전면신식화구건종합결책신식계통제공료이론삼고。
Granular computing can help improving the capability of handling massive unstructured Web information. Howev-er, the current studies are limited to the structure of web links, granularity division and the building of information granules tree;and the association strength among information granules were never analyzed. For the problem of incomplete Web information fil-tering, an algorithm based on multi-level granularity division was proposed to calculate the association strength among web infor-mation granules. The algorithm gave a quantitative analysis to the same level web information granules of different types by acqui-ring direct or indirect links between web pages to do matrix operation. The correctness and effectiveness of the algorithm was veri-fied by the experiment. The algorithm can solve the problems about unitary and one-sidedness effectively when using information or making a decision. It provides a theoretical reference to obtain comprehensive information and build a composite decision infor-mation system.