Skip to main content
Top

2015 | OriginalPaper | Chapter

9. Clustering Items in Time-Stamped Databases

Authors : Animesh Adhikari, Jhimli Adhikari

Published in: Advances in Knowledge Discovery in Databases

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Many multi-branch companies transact from different branches. Each branch of the company maintains a separate database over time. The variation of sales of an item over time is an important issue, and therefore, we present the notion of stability of an item. Stable items are useful in making numerous strategic decisions of the company. We have discussed two measures of stability of an item. Based on the degree of stability of an item, an algorithm is designed for finding partition among items in different data sources. Then the notion of the best cluster is introduced by considering average degree of variation of a class, and designed an algorithm to find clusters among items in different data sources. The best cluster is determined by average degree of variation in a cluster. Experimental results are provided for three transactional databases.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference Adhikari A, Ramachandrarao P, Pedrycz W (2010) Developing multi-databases mining applications. Springer, LondonCrossRef Adhikari A, Ramachandrarao P, Pedrycz W (2010) Developing multi-databases mining applications. Springer, LondonCrossRef
go back to reference Adhikari A, Rao PR (2008a) Synthesizing heavy association rules from different real data sources. Pattern Recogn Lett 29(1):59–71CrossRef Adhikari A, Rao PR (2008a) Synthesizing heavy association rules from different real data sources. Pattern Recogn Lett 29(1):59–71CrossRef
go back to reference Adhikari A, Rao PR (2008b) Efficient clustering of databases induced by local patterns. Decis Support Syst 44(4):925–943CrossRef Adhikari A, Rao PR (2008b) Efficient clustering of databases induced by local patterns. Decis Support Syst 44(4):925–943CrossRef
go back to reference Adhikari J, Rao PR, Adhikari A (2009) Clustering items in different data sources induced by stability. Int Arab J Inf Technol 6(4):394–402 Adhikari J, Rao PR, Adhikari A (2009) Clustering items in different data sources induced by stability. Int Arab J Inf Technol 6(4):394–402
go back to reference Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD conference management of data, pp 207–216 Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD conference management of data, pp 207–216
go back to reference Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of 20th very large databases (VLDB) conference, pp 487–499 Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of 20th very large databases (VLDB) conference, pp 487–499
go back to reference Albanese M, Molinaro C, Persia F, Picariello A, Subrahmanian VS (2014) Discovering the top-k unexplained sequences in time-stamped observation data, IEEE Trans Knowl Data Eng 26(3):577–594 Albanese M, Molinaro C, Persia F, Picariello A, Subrahmanian VS (2014) Discovering the top-k unexplained sequences in time-stamped observation data, IEEE Trans Knowl Data Eng 26(3):577–594
go back to reference Bluman AG (2006) Elementary statistics: a step by step approach. Mcgraw Hill, New York Bluman AG (2006) Elementary statistics: a step by step approach. Mcgraw Hill, New York
go back to reference Brockwell J, Richard D (2002) Introduction to time series and forecasting. Springer, BerlinCrossRefMATH Brockwell J, Richard D (2002) Introduction to time series and forecasting. Springer, BerlinCrossRefMATH
go back to reference Estivill-Castro V, Yang J (2004) Fast and robust general purpose clustering algorithms. Data Min Knowl Disc 8(2):127–150CrossRefMathSciNet Estivill-Castro V, Yang J (2004) Fast and robust general purpose clustering algorithms. Data Min Knowl Disc 8(2):127–150CrossRefMathSciNet
go back to reference Guil F, Marín R (2012) A tree structure for event-based sequence mining. Knowl-Based Syst 35:186–200CrossRef Guil F, Marín R (2012) A tree structure for event-based sequence mining. Knowl-Based Syst 35:186–200CrossRef
go back to reference Han J, Pei J, Yiwen Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD conference management of data, pp 1–12 Han J, Pei J, Yiwen Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD conference management of data, pp 1–12
go back to reference Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264–323CrossRef Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264–323CrossRef
go back to reference Leonard M, Wolfe B (2005) Mining transactional and time series data. In: Proceedings of SUGI 30, paper 080–30 Leonard M, Wolfe B (2005) Mining transactional and time series data. In: Proceedings of SUGI 30, paper 080–30
go back to reference Liu B, Ma Y, Lee R (2001) Analyzing the interestingness of association rules from the temporal dimension. In: Proceedings of IEEE international conference on data mining, pp 377–384 Liu B, Ma Y, Lee R (2001) Analyzing the interestingness of association rules from the temporal dimension. In: Proceedings of IEEE international conference on data mining, pp 377–384
go back to reference Liu CL (1985) Elements of discrete mathematics. McGraw-Hill, New YorkMATH Liu CL (1985) Elements of discrete mathematics. McGraw-Hill, New YorkMATH
go back to reference Matsubara Y, Sakurai Y, Faloutsos C, Iwata T, Yoshikawa M (2012) Fast mining and forecasting of complex time-stamped events. In: Proceedings of KDD conference, pp 271–279 Matsubara Y, Sakurai Y, Faloutsos C, Iwata T, Yoshikawa M (2012) Fast mining and forecasting of complex time-stamped events. In: Proceedings of KDD conference, pp 271–279
go back to reference Tan PN, Kumar V, Srivastava J (2002) Selecting the right interestingness measure for association patterns. In: Proceedings of SIGKDD conference, pp 32–41 Tan PN, Kumar V, Srivastava J (2002) Selecting the right interestingness measure for association patterns. In: Proceedings of SIGKDD conference, pp 32–41
go back to reference Wu X, Zhang C, Zhang S (2005) Database classification for multi-database mining. Inf Syst 30(1):71–88CrossRefMATH Wu X, Zhang C, Zhang S (2005) Database classification for multi-database mining. Inf Syst 30(1):71–88CrossRefMATH
go back to reference Yang K, Shahabi C (2005) On the stationarity of multivariate time series for correlation-based data. In: Proceedings of ICDM, pp 805–808 Yang K, Shahabi C (2005) On the stationarity of multivariate time series for correlation-based data. In: Proceedings of ICDM, pp 805–808
go back to reference Zhang T, Ramakrishnan R, Livny M (1997) BIRCH: a new data clustering algorithm and its applications. Data Min Knowl Disc 1(2):141–182CrossRef Zhang T, Ramakrishnan R, Livny M (1997) BIRCH: a new data clustering algorithm and its applications. Data Min Knowl Disc 1(2):141–182CrossRef
go back to reference Zhang S, Wu X, Zhang C (2003) Multi-database mining. IEEE Comput Intell Bull 2(1):5–13 Zhang S, Wu X, Zhang C (2003) Multi-database mining. IEEE Comput Intell Bull 2(1):5–13
Metadata
Title
Clustering Items in Time-Stamped Databases
Authors
Animesh Adhikari
Jhimli Adhikari
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-13212-9_9

Premium Partner