Skip to main content
Erschienen in: Knowledge and Information Systems 1/2016

01.01.2016 | Regular Paper

A novel algorithm for mining closed temporal patterns from interval-based data

verfasst von: Yi-Cheng Chen, Julia Tzu-Ya Weng, Lin Hui

Erschienen in: Knowledge and Information Systems | Ausgabe 1/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Closed sequential patterns have attracted researchers’ attention due to their capability of using compact results to preserve the same expressive power as conventional sequential patterns. However, studies to date have mainly focused on mining conventional patterns from time interval-based data, where each datum persists for a period of time. Few research efforts have elaborated on discovering closed interval-based sequential patterns (also referred to as closed temporal patterns). Mining closed temporal patterns are an arduous problem since the pairwise relationships between two interval-based events are intrinsically complex. In this paper, we develop an efficient algorithm, CCMiner, which stands for Closed Coincidence Miner to discover frequent closed patterns from interval-based data. The algorithm also employs some optimization techniques to effectively reduce the search space. The experimental results on both synthetic and real datasets indicate that CCMiner not only significantly outperforms the prior interval-based mining algorithms in execution time but also possesses graceful scalability. Furthermore, we also apply CCMiner to a real dataset to show the practicability of time interval-based closed pattern mining.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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 "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!

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!

Literatur
1.
Zurück zum Zitat Achar A, Laxman S, Sastry P (2012) A unified view of the apriori-based algorithms for frequent episode discovery. Knowl Inf Syst 31:223–250CrossRef Achar A, Laxman S, Sastry P (2012) A unified view of the apriori-based algorithms for frequent episode discovery. Knowl Inf Syst 31:223–250CrossRef
2.
Zurück zum Zitat Agrawal R, Srikant R (1995) Mining Sequential Patterns. In: Proceedings of 11th international conference on data engineering (ICDE’95), pp 3–14 Agrawal R, Srikant R (1995) Mining Sequential Patterns. In: Proceedings of 11th international conference on data engineering (ICDE’95), pp 3–14
3.
Zurück zum Zitat Allen J (1983) Maintaining knowledge about temporal intervals. Commun ACM 26(11):832–843MATHCrossRef Allen J (1983) Maintaining knowledge about temporal intervals. Commun ACM 26(11):832–843MATHCrossRef
4.
Zurück zum Zitat Chang L, Wang T, Yang D, Luan H (2008) SeqStream: Mining closed sequential patterns over stream sliding windows. In: The 8th international conference on data mining (ICDM’08), pp 83–92 Chang L, Wang T, Yang D, Luan H (2008) SeqStream: Mining closed sequential patterns over stream sliding windows. In: The 8th international conference on data mining (ICDM’08), pp 83–92
5.
Zurück zum Zitat Chen Y, Jiang J, Peng W, Lee S (2010) An efficient algorithm for mining time interval-based patterns in large databases. In: The 19th ACM international conference on information and knowledge management (CIKM’10), pp 49–58 Chen Y, Jiang J, Peng W, Lee S (2010) An efficient algorithm for mining time interval-based patterns in large databases. In: The 19th ACM international conference on information and knowledge management (CIKM’10), pp 49–58
6.
Zurück zum Zitat Hoppner F (2002) Finding informative rules in interval sequences. Intel Data Anal 6(3):237–255MathSciNet Hoppner F (2002) Finding informative rules in interval sequences. Intel Data Anal 6(3):237–255MathSciNet
7.
Zurück zum Zitat Hsu F, Lee S, Lin B (1999) 2D C-tree spatial representation for iconic image. J Vis Lang Comput 10:147–164CrossRef Hsu F, Lee S, Lin B (1999) 2D C-tree spatial representation for iconic image. J Vis Lang Comput 10:147–164CrossRef
8.
Zurück zum Zitat Huang K, Chang C, Tung J, Ho C (2006) COBRA: closed sequential pattern mining using bi-phase reduction approach. In: Proceedings of the 2006 international conference on data warehousing and knowledge discovery (DaWaK’06), pp 280–291 Huang K, Chang C, Tung J, Ho C (2006) COBRA: closed sequential pattern mining using bi-phase reduction approach. In: Proceedings of the 2006 international conference on data warehousing and knowledge discovery (DaWaK’06), pp 280–291
9.
Zurück zum Zitat Kam P, Fu W (2000) Discovering temporal patterns for interval-based events. In: Proceedings of the 2000 international conference on data warehousing and knowledge discovery (DaWaK’00), pp 317–326 Kam P, Fu W (2000) Discovering temporal patterns for interval-based events. In: Proceedings of the 2000 international conference on data warehousing and knowledge discovery (DaWaK’00), pp 317–326
10.
Zurück zum Zitat Lee S, Hsu F (1990) 2D C-string: a new spatial knowledge representation for image database systems. Pattern Recogn 23:1077–1087CrossRef Lee S, Hsu F (1990) 2D C-string: a new spatial knowledge representation for image database systems. Pattern Recogn 23:1077–1087CrossRef
11.
Zurück zum Zitat Li H, Huang H, Lee S (2011) Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits. Knowl Inf Syst 28:495–422CrossRef Li H, Huang H, Lee S (2011) Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits. Knowl Inf Syst 28:495–422CrossRef
12.
Zurück zum Zitat Lin M, Lee S (2005) Fast discovery of sequential patterns by memory indexing and database partitioning. J Inf Sci Eng 21(1):109–128 Lin M, Lee S (2005) Fast discovery of sequential patterns by memory indexing and database partitioning. J Inf Sci Eng 21(1):109–128
13.
Zurück zum Zitat Mannila H, Toivonen Verkamo I (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Disc 1(3):259–289CrossRef Mannila H, Toivonen Verkamo I (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Disc 1(3):259–289CrossRef
14.
Zurück zum Zitat Masseglia F, Cathala F, Poncelet P (1998) The PSP approach for mining sequential patterns. In: European conference on principles of data mining and knowledge discovery (PKDD’01), pp 176–184 Masseglia F, Cathala F, Poncelet P (1998) The PSP approach for mining sequential patterns. In: European conference on principles of data mining and knowledge discovery (PKDD’01), pp 176–184
16.
Zurück zum Zitat Morchen F, Ultsch A (2007) Efficient mining of understandable patterns from multivariate interval time series. Data Min Knowl Discov 15(2):181–215MathSciNetCrossRef Morchen F, Ultsch A (2007) Efficient mining of understandable patterns from multivariate interval time series. Data Min Knowl Discov 15(2):181–215MathSciNetCrossRef
17.
Zurück zum Zitat Morchen F, Fradkin D (2010) Robust mining of time intervals with semi-interval partial order patterns. In: Proceedings of the SIAM international conference on data mining (SDM’10), pp 315–326 Morchen F, Fradkin D (2010) Robust mining of time intervals with semi-interval partial order patterns. In: Proceedings of the SIAM international conference on data mining (SDM’10), pp 315–326
18.
Zurück zum Zitat Moskovitch R, Shahar Y (2009) Karmalego—fast time intervals mining. Technical Report 23, ISE-TECHREP Ben Gurion University Moskovitch R, Shahar Y (2009) Karmalego—fast time intervals mining. Technical Report 23, ISE-TECHREP Ben Gurion University
19.
Zurück zum Zitat Papapetrou P, Kollios G, Sclaroff S, Gunopulos D (2005) Discovering frequent arrangements of temporal intervals. In: The 5th international conference on data mining (ICDM’05), pp 354–361 Papapetrou P, Kollios G, Sclaroff S, Gunopulos D (2005) Discovering frequent arrangements of temporal intervals. In: The 5th international conference on data mining (ICDM’05), pp 354–361
20.
Zurück zum Zitat Patel D, Hsu W, Lee M (2008) Mining relationships among interval-based events for classification. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data (SIGMOD’08), pp 393–404 Patel D, Hsu W, Lee M (2008) Mining relationships among interval-based events for classification. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data (SIGMOD’08), pp 393–404
21.
Zurück zum Zitat Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal D, Hsum M (2004) Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng 16(10):1424–1440 Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal D, Hsum M (2004) Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng 16(10):1424–1440
22.
Zurück zum Zitat Rodriguez-Gonzalez A, Martinez-Trinidad J, Carrasco-Ochoa J, Ruiz-Shulcloper J (2011) RP-Miner: a relaxed prune algorithm for frequent similar pattern mining. Knowl Inf Syst 27:451–471CrossRef Rodriguez-Gonzalez A, Martinez-Trinidad J, Carrasco-Ochoa J, Ruiz-Shulcloper J (2011) RP-Miner: a relaxed prune algorithm for frequent similar pattern mining. Knowl Inf Syst 27:451–471CrossRef
23.
Zurück zum Zitat Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: Proceedings of 5th international conference on extended database technology (EDBT’96), pp 3–17 Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: Proceedings of 5th international conference on extended database technology (EDBT’96), pp 3–17
24.
Zurück zum Zitat Villafane R, Hua K, Tran D (2000) Knowledge discovery from series of interval events. J Intel Inf Syst 15:71–89CrossRef Villafane R, Hua K, Tran D (2000) Knowledge discovery from series of interval events. J Intel Inf Syst 15:71–89CrossRef
25.
Zurück zum Zitat Wang J, Han J (2004) BIDE: efficient mining of frequent closed sequences. In: Proceedings of the 20th international conference on data engineering (ICDE’04), pp 79–90 Wang J, Han J (2004) BIDE: efficient mining of frequent closed sequences. In: Proceedings of the 20th international conference on data engineering (ICDE’04), pp 79–90
26.
Zurück zum Zitat Winarko E, Roddick J (2007) ARMADA—an algorithm for discovering richer relative temporal association rules from interval-based data. Data Knowl Eng 63(1):76–90CrossRef Winarko E, Roddick J (2007) ARMADA—an algorithm for discovering richer relative temporal association rules from interval-based data. Data Knowl Eng 63(1):76–90CrossRef
27.
Zurück zum Zitat Wu S, Chen Y (2007) Mining nonambiguous temporal patterns for interval-based events. IEEE Trans Knowl Data Eng 19(6):742–758CrossRef Wu S, Chen Y (2007) Mining nonambiguous temporal patterns for interval-based events. IEEE Trans Knowl Data Eng 19(6):742–758CrossRef
28.
Zurück zum Zitat Wu S, Chen Y (2009) Discovering hybrid temporal patterns from sequences consisting of point- and interval-based events. Data Knowl Eng 68(11):1309–1330CrossRef Wu S, Chen Y (2009) Discovering hybrid temporal patterns from sequences consisting of point- and interval-based events. Data Knowl Eng 68(11):1309–1330CrossRef
29.
Zurück zum Zitat Yan X, Cheng H, Han J, Xin D (2003) CloSpan: mining closed sequential patterns in large datasets. In: Proceedings of 3rd SIAM international conference on data mining (SDM’3), pp 166–177 Yan X, Cheng H, Han J, Xin D (2003) CloSpan: mining closed sequential patterns in large datasets. In: Proceedings of 3rd SIAM international conference on data mining (SDM’3), pp 166–177
30.
Zurück zum Zitat Zaki M (2001) SPADE: an efficient algorithm for mining frequent sequences. Mach Learn 42(1–2):31–60MATHCrossRef Zaki M (2001) SPADE: an efficient algorithm for mining frequent sequences. Mach Learn 42(1–2):31–60MATHCrossRef
31.
Zurück zum Zitat Zaki M, Hsiao C (2002) CHARM: an Efficient algorithm for closed itemset mining. In: Proceedings of 2nd SIAM international conference on data mining (SDM’02), pp 457–478 Zaki M, Hsiao C (2002) CHARM: an Efficient algorithm for closed itemset mining. In: Proceedings of 2nd SIAM international conference on data mining (SDM’02), pp 457–478
32.
Zurück zum Zitat Zhang L, Chen G, Brijs T, Zhang X (2008) Discovering during-temporal patterns (DTPs) in large temporal databases. Expert Syst Appl 34:178–11 Zhang L, Chen G, Brijs T, Zhang X (2008) Discovering during-temporal patterns (DTPs) in large temporal databases. Expert Syst Appl 34:178–11
Metadaten
Titel
A novel algorithm for mining closed temporal patterns from interval-based data
verfasst von
Yi-Cheng Chen
Julia Tzu-Ya Weng
Lin Hui
Publikationsdatum
01.01.2016
Verlag
Springer London
Erschienen in
Knowledge and Information Systems / Ausgabe 1/2016
Print ISSN: 0219-1377
Elektronische ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-014-0815-2

Weitere Artikel der Ausgabe 1/2016

Knowledge and Information Systems 1/2016 Zur Ausgabe