摘要
This paper establishes a theory architecture to accept or reject or reserve synchronously a pair of rules look like A→B and B→A by analyzing correlation and sufficiency gene, and presents its algorithms. Prara 1 reduces domain specialist workload, realiazes evaluative goal of decreasing people's limitation. Prara 2 also reduces workload of mining-evaluating algorithm.
This paper establishes a theory architecture to accept or reject or reserve synchronously a pair of rules look like A→B and B→A by analyzing correlation and sufficiency gene, and presents its algorithms. Praral reduces domain specialist workload, realiazes evaluative goal of decreasing people's limitation . Prara2 also reduces workload of mining-evaluating algorithm.
出处
《计算机科学》
CSCD
北大核心
2003年第6期126-128,共3页
Computer Science
基金
国家自然科学基金重点项目(69835001)
北京市自然科学基金(4022008)