Skip to main content
SpringerLink
Log in

An Efficient Clustering Algorithm for Patterns Placement in Walkthrough System

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Mining of sequential patterns in walkthrough systems is an interesting data mining problem. It can be envisioned as a tool for forecasting and prediction of the future behavior of user’s traversal patterns. In the past, how to display the object faster in the next time were their concerns. They seldom consider the problem of access times of objects in the storage systems. In this paper, we will consider this problem and solve this by clustering. Clustering methodology is particularly appropriate for the exploration of interrelationships among objects to reduce the access times of objects. We record the user’s path as log-data and store it in database. After a certain period of time, we will process the log-data database for user traversal paths and find out their characteristics, which will be utilized to determine the optimal physical organization of those VRML objects on disks. Meanwhile, we also introduce the relationships among transactions, views and objects. According to these relationships, we suggest the clustering criteria--inter-pattern similarity, which utilize these characteristics to distribute the objects into the appropriate clusters. As a result, the large-scale VRML models could be accessed more efficiently, allowing for a real-time walk-through in the scene.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aggrawal R., Gehrke J., Gunopulos D., Raghawan P. (1998). Automatic subspace clustering of high dimensional data for data mining applications. Proceeding ACM SIGMOD International Conference on Management of Data, Seattle, WA. pp. 94–105.

  • Agrawal, R., Tomasz I. and Arun N. Swami (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216.

  • Daniel, G. A. and Anselmo, L. (1996) Automatic image placement to provide a guaranteed frame rate. Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, pp. 307–316.

  • Berchtold, S., Daniel, A. K. and Hans-Peter, K. (1996) The X–tree: an Index structure for high-dimensional data. Proceedings of the 22nd International Conference on Very Large Databases, San Francisco, August 1996, pp. 28–39.

  • Berkhin, P. (2002) Survey of clustering data mining techniques.http://www.accrue.com/products/rp_cluster_review.pdf, Technical Report, Accrue Software.

  • Berson, A. and Smith, S. J. (1997). Data warehousing, Data Mining & OLAP, McGraw-Hill, Inc.,

  • Bradly, P., Fayyad, U. and Reina, C. (1998) Scaling clustering algorithms to large datasets. Proceeding 4th International Conference on Knowledge Discovery and Data Mining (KDD 98).

  • Bradly, P., Fayyad, U. and Reina, C. (1999) Scaling EM(expectation-maximization) clustering to large databases. Technical Report MSR-TR-98-35, Microsoft Research.

  • L. D. Catledge E. P. James (1995) ArticleTitleCharacterizing browsing strategies in the world–wide web Computer Networks and ISDN systems 27 IssueID6 1065–1073 Occurrence Handle10.1016/0169-7552(95)00043-7

    Article  Google Scholar 

  • Chakrabarti, S. (2003) Mining the web: discovering knowledge from hypertext data, Morgan Kaufmann Publishing

  • Ming-Syan C., Jong Soo P., Philip S. Yu. (1996) Efficient data mining for path traversal patterns. Proceedings of the 16th International Conference on Distributed Computing Systems, pp. 385–392

  • C. Ming-Syan P. Jong Soo S.Yu Philip (1998) ArticleTitleEfficient data mining for path traversal patterns IEEE Transactions on Knowledge and Data Engineering 10 IssueID2 209–221 Occurrence Handle10.1109/69.683753

    Article  Google Scholar 

  • I. S. Dhillon M. M. Edward Roshan Usman (2003) ArticleTitleDiametrical clustering for identifying anti–correlated gene clusters Bioinformatics 19 1612–1619 Occurrence Handle10.1093/bioinformatics/btg209 Occurrence Handle12967956

    Article  PubMed  Google Scholar 

  • Domingos P., Hulten G. (2002). Learning from infinite data in finite time. Advances in Neural Information Processing System. 14

  • zu Eiben S. M., Stein B. (2002). Analysis of clustering algorithms for web-based search. Practical Aspects of Knowledge Management. Volume 2569 LNAI of Lecture Notes in Artificial Intelligence, Berlin Heidelberg, Springer, December 2002, pp. 168–178

  • Eirinaki, M. and Michalis, V. (2003) Web mining for web personalization. ACM Transactions on Internet Technology (TOIT), 3(1), 1–27, February 2003.

    Google Scholar 

  • Ester M., Kriegel H. P., Sander J. and Xu X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. Proceeding the Second International Conference on Knowledge Discovery and Data Mining (KDD), pp. 226–231

  • Martin, E., Hans-Peter, K., Jorg, S. and Xiaowei, Xu. (1998) Clustering for mining in large spatial databases. KI (Artificial Intelligence), Special Issue on Data Mining, ScienTec Publishing, pp. 18–24, March 1998

  • Mathias, G. and Hatem, H. (2003) Evaluation of web usage mining approaches for user’s next request prediction. Proceedings of the Fifth ACM International Workshop on Web Information and Data Management, pp. 74–81

  • Guo, D., Peuquet, D. and Gahegan, M. (2002) Opening the black box: interactive hierarchical clustering for multivariate spatial patterns. Proceedings of the Tenth ACM International Symposium on Advances in Geographic Information Systems, pp. 131–136 November 2002.

  • Eui-Hong, H., George, K., Vipin, K. and Bamshad, M. (1997) Clustering based on association rules hypergraphs. Proceedings Workshop on Research Issues on Data Mining and Knowledge Discovery.

  • Han, E.-H., George, K., Vipin, K. and Bamshad, M. (1998) Hypergraph based clustering in high-dimensional data sets: a summary of results. Data Engineering Bulletin of IEEE Computer Society, 21(1)

  • Hinneburg, A. and Keim, D. A. (1998) An efficient approach to clustering in multimedia databases with noise. Proceeding of the 4th International Conference on Knowledge Discovery and Data Mining, New York, AAAI Press, pp. 58–65

  • Hinneburg, A., Daniel, A. K. and Wawryniuk, M. (1999) Cluster discovery methods for large databases: from the past to the future. Tutorial, Proceeding ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, pp. 506–517.

  • Karypis, G., Eui-Hong (Sam) Han. and Vipin, K. (1999) CHAMELEON: a Hierarchical clustering algorithm using dynamic modeling. Computer, IEEE Computer Society, 32(8), 68–75

  • L. Kaufman P. J. Rousseeuw (1990) Finding Groups in Data: An Introduction to Cluster Analysis Wiley New York

    Google Scholar 

  • MacQueen, J. (1967) Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, University of California Press, Berkeley, pp. 281–297

  • Rosa M., Pier Luca L., Maristella M. and Roberto E. (2003) Clustering documents in a web directory. Proceedings of the fifth ACM International Workshop on Web Information and Data Management, New Orleans, Lousiana, November 2003 pp. 66–73

  • Rosa, M., Pier Luca, L., Maristella, M. and Roberto, E. (2004) Integrating web conceptual modeling and web usage mining. Proceedings of the 10th ACM SIGKDD Workshop on Web Mining and Web Usage Analysis, Seattle, Washington, August 2004, pp. 428–439

  • Morzy, T., Wojciechowski, M. Zakrzewicz, M. (1999) Pattern–oriented hierarchical clustering. Proceedings of the 3rd East European Conference on Advances in Databases and Information Systems (ADBIS’99), Maribor, Slovenia, LNCS 1691, Springer–Verlag

  • Y. Nakamura T. Tamada (1994) ArticleTitleAn efficient 3D object management and interactive walkthrough for the 3D facility management system Proceedings IECON’ 94 IssueID2 1937–1941

    Google Scholar 

  • Y. Nakamura S. Abe Y. Ohsawa M. Sakauchi (1993) ArticleTitleA balanced hierarchical data structure multidimensional dada with efficient dynamic characteristic IEEE Transactions on Knowledge and Data Engineering 5 IssueID4 682–694 Occurrence Handle10.1109/69.234779

    Article  Google Scholar 

  • Palmer, C. R. and Faloutsos, C. (2000) Density biased sampling: an improved method for data mining and clustering. Proceeding International Conference on Management of Data, ACM SIGMOD, pp. 82–92

  • Shikholeslami, G., Chatterjee S. and Zhang A. (1998) Wave cluster: a multi-resolution clustering approach for very large spatial databases. Proceedings of the 24th International Conference on Very large Databases, New York. pp. 428–439

  • S. Jaideep C. Robert D. Mukund T. Pang–Ning (2000) ArticleTitleWeb usage mining: discovery and applications of usage patterns from web data ACM SIGKDD Explorations Newsletter 1 IssueID2 12–23

    Google Scholar 

  • Steinbach, M., Levent, E. and Vipin, K. (2003) Challenges of Clustering High Dimensional Data. Applications in Econophysics, Bioinformatics, and Pattern Recognition, Springer-Verlag

  • Tantrum J., Alejandro M. and Werner S. (2002). Hierarchical model-based clustering of large datasets through fractionation and refractionation. SIGKDD’02, 183–190

  • Ungar, L. H. and Foster, D. P. (1998) Clustering methods For collaborative filtering. Proceedings of the Workshop on Recommendation Systems, AAAI Press, Menlo Park California

  • Wang, W., Yang, J. and Muntz, R. (1997) STING: A statistical information grid approach to spatial data mining. Proceedings of the 23rd International conference on Very large Databases, Athens, Greece, pp. 186–195

  • Zhang T., Ramakrishnan R. and Livny M. (1996) BIRCH: an efficient data clustering method for very large databases. ACM SIGMOD Record, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Vol. 25(2), pp. 103–114, Montreal, Quebec, Canada

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, 621, Republic of China

    Shao-Shin Hung, Ting-Chia Kuo & Damon Shing-Min Liu

Authors
  1. Shao-Shin Hung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ting-Chia Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Damon Shing-Min Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shao-Shin Hung.

Additional information

Author for correspondence and also is an instructor of WuFeng Institute of Technology.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hung, SS., Kuo, TC. & Liu, D.SM. An Efficient Clustering Algorithm for Patterns Placement in Walkthrough System. J Intell Manuf 16, 587–597 (2005). https://doi.org/10.1007/s10845-005-4364-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-005-4364-0

Keywords

Search

Navigation