會議論文
| 學年 | 81 |
|---|---|
| 學期 | 2 |
| 發表日期 | 1993-05-28 |
| 作品名稱 | Automatic Clustering of Business Processes in Information Systems Planning |
| 作品名稱（其他語言） | |
| 著者 | 傅志忠 |
| 作品所屬單位 | 淡江大學資訊管理學系 |
| 出版者 | |
| 會議名稱 | 一九九三第四屆全國資訊管理研討會=The Fourth National Conference on Information Management |
| 會議地點 | 臺北市, 臺灣 |
| 摘要 | BSP is an important methodology in information systems planning. To identify the business processes of a company is a critical step for developing an information architecture. Because hundred of business processes will be identified in a large-scale company, to manipulate them manually becomes a difficult and tedious job. In the age of CASE, the IS planning process ought to be automated in order to reduce human efforts. The motivation of this paper would like to automate some steps in BSP. How to cluster business processes into a set of process groups (or called subsystems) in an efficient way is an interesting topic and worth being studied deeply. The problem studied in this paper is defined to be how to cluster business processes into a fixed number of groups, such that the data dependency relation between groups is minimized. The approach is transforming the problem into a shortest path searching problem in a multi-stage graph. Dynamic programming is the main technique used to solve the problem. The idea and algorithm presented in this paper can be applied in designing an IS planning tool in the field of CASE. |
| 關鍵字 | 資訊系統規劃;企業;電腦輔助軟體工程;叢聚;最短路徑;動態程式設計;資訊管理;Information System Planning;Enterprise;Case;Clustering;Shortest Path;Dynamic Programming;Information Management |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國內 |
| 校內研討會地點 | |
| 研討會時間 | 19930528~19930529 |
| 通訊作者 | |
| 國別 | TWN |
| 公開徵稿 | Y |
| 出版型式 | 紙本 |
| 出處 | 一九九三第四屆全國資訊管理研討會論文集=Proceedings of the Fourth National Conference on Information Management，頁41288 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95091 ) |