Impulsion Of Mining Paradigm In ERP
[Full Text]
AUTHOR(S)
Kowsalya.S, M.Phil Scholar
KEYWORDS
DBSCAN, SOM, BOM
ABSTRACT
Traditionally, the construction industry has been faced with the problems of meeting project schedule, budget, and specifications set by the owner and architect/engineer. The proper utilization of internal and external resources is essential if construction companies are to make the best business decisions, maximize business goals, and survive in the competitive environment. Although the construction industry is one of the largest contributors to the economy, it is considered to be one of the most highly fragmented, inefficient, and geographically dispersed industries. To overcome this inefficiency, a number of solutions have long been offered including adaptation of information technology and information systems. Major construction companies embarked on the implementation of integrated IT solutions such as enterprise resource planning (ERP) systems to better integrate their various business functions. Each construction project is characterized by a unique set of site conditions, project team, and the temporary nature of relationships between project stakeholders. As a result, construction companies are required to have extensive customization of preintegrated business applications from the vendors of ERP systems. Unfortunately, such extensive customizations result in a greater challenge in implementing ERP systems. Therefore, finding the best ERP systems implementation strategy is needed to maximize the benefits of such integrated IT solutions for construction companies. Here I suggest an approach and implementation of mining paradigm in ERP system which provides the best solutions and better results. Since ERP deals with large volume of data and the challenge in that is its way of representation. By getting mining paradigm into its way there reside various approaches to bring the data in crisp and legitimate formats. My approach on this doesn’t end with getting the mining paradigm into ERP’s implementation; also I have developed a POC (Proof of Concept) on DBSCAN method of mining which depicts both functional and technical workings into act. To make this concept a proved one with real time workings, I have provided the facts and approaches that a construction company follows in real world and the data they dealt with. This paper also encloses how this DBSCAN method works over this business functionality in different dimensions to prove its working.
REFERENCES
Books:
[1] Kaufman L. and Rousseeuw P. J (1990), “Finding Groups in Data: An Introduction to Cluster Analysis”, John Wiley & Sons.
[2] Ankerst M., Markus M. B., Kriegel H., Sander J(1999), “OPTICS: Ordering Points To Identify the Clustering Structure”, Proc.ACM SIGMOD’99 Int. Conf. On Management of Data, Philadelphia, PA, pp.4960.
[3] Guha S, Rastogi R, Shim K (1998), “CURE: An efficient clustering algorithm for large databases”, In: SIGMOD Conference, pp.73~84.
[4] Ester M., Kriegel H., Sander J., Xiaowei Xu (1996), “A DensityBased Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, KDD’96, Portland, OR, pp.226231.
[5] Wang W., Yang J., Muntz R(1997), “STING: A statistical information grid approach to spatial data mining”, In: Proc. of the 23rd VLDB Conf. Athens, pp.186~195.
[6] Raymond T. Ng and Jiawei Han (2002), “CLARANS: A Method for Clustering Objects for Spatial Data Mining”, IEEE Transactions on Knowledge and Data Engineering, Vol. 14, No. 5.
[7] Rakesh A., Johanners G., Dimitrios G., Prabhakar R(1999), “Automatic subspace clustering of high dimensional data for data mining applications”, In: Proc. of the ACM SIGMOD, pp.94~105.
[8] Efficient Map/ReduceBased DBSCAN Algorithm with Optimized Data Partition BiRuDai  dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ. of Sci. & Technol Taipei, Taiwan.
[9] An Improved DBSCAN Algorithm for High Dimensional Datasets by Glory Shah Kaufman L. and Rousseeuw P. J (1990), “Finding Groups in Data: An Introduction to Cluster Analysis”, John Wiley & Sons.
[10] Ankerst M., Markus M. B., Kriegel H., Sander J(1999), “OPTICS: Ordering Points To Identify the Clustering Structure”, Proc.ACM SIGMOD‟99 Int. Conf. On Management of Data, Philadelphia, PA, pp.4960.
[11] Guha S, Rastogi R, Shim K (1998), “CURE: An efficient clustering algorithm for large databases”, In: SIGMOD Conference, pp.73~84. Ester M., Kriegel H., Sander J., Xiaowei Xu (1996), “A DensityBased
[12] Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, KDD‟96, Portland, OR, pp.226231. Wang W., Yang J., Muntz R(1997), “STING: A statistical information grid approach to spatial data mining”, In: Proc. of the 23rd VLDB Conf. Athens, pp.186~195.
Thesis:
[13] http://genome.tugraz.at/MedicalInformatics2/SOM.pdf
[14] http://www.cs.bham.ac.uk/~jxb/NN/l17.pdf
[15] http://lib.tkk.fi/Diss/2002/isbn951226093X/article4.pdf
[16] http://www.cs.hmc.edu/~kpang/nn/som.html
[17] http://www2.tku.edu.tw/~tkjse/51/515.pdf
[18] http://users.ics.aalto.fi/mikkok/thesis/book/node12.html
[19] http://kanaya.naist.jp/SOM/
