WKMSD: Using Knowledge Base for Work Flows of Distributed Integrated Systems by a Proposed Algorithm with Data Mining Mechanism
In this paper, with using knowledge base, we will present work flows of distributed integrated systems by the Proposed WKMSD algorithm with data mining mechanism. Using index parameters, WKMSD Proposed algorithm has decreased data abundance accumulation percentage and the new algorithm presents a technical method so that, using it, we may reduce the information search time at the banks. Using A-Means algorithm, new WKMSD algorithm presents a new technique which considering the range of data clustering, reduction of repetitive data, and selection of the optimal location for collecting data reduces the final scheduling in information bank search survey. This new technique creates information processing through updating and sharing of data by a cycle for using the resulted product in which the speed obtained from new algorithm process with data mining mechanism for distributed integrated systems has increased. The new WKMSD Proposed algorithm has a higher performance and dependability and, eventually, the volume of records is considerably reduced compared with data scheduling survey.
WKMSD ERPSD ERPASD Data Mining Knowledge Base Scheduling Dependability
Arash Ghorbannia Delavar Majid Feizollahi Nasim Anisi
Payame Noor University Tehran, Iran Payame Noor niversity Jame Elmi Karbordi University (Khane Kargar center) Tehran, Iran Payame Noor University O11C Company Tehran, Iran
国际会议
贵阳
英文
49-53
2011-01-26（万方平台首次上网日期，不代表论文的发表时间）