Mining frequent arrangements of temporal intervals
- Author
- PAPAPETROU, Panagiotis1 ; KOLLIOS, George1 ; SCLAROFF, Stan1 ; GUNOPULOS, Dimitrios2
[1] Department of Computer Science, Boston University, Boston, MA 02215, United States
[2] Department of Informatics and Telecommunications, University of Athens, Athens, Greece - Source
Knowledge and information systems (Print). 2009, Vol 21, Num 2, pp 133-171, 39 p ; ref : 74 ref
- ISSN
- 0219-1377
- Scientific domain
- Computer science
- Publisher
- Springer, London
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- American sign language Arrangement mining Arrangement rule mining Constraint-based mining Data mining Sequential pattern mining Temporal mining
- Keyword (fr)
- American Sign Language Analyse donnée Analyse intervalle Analyse linguistique Annotation Arithmétique intervalle Base de données Base donnée très grande Bioinformatique Corrélation Elagage Extraction information Fouille donnée Intervalle temps Intérêt Langage gestuel Recherche profondeur d'abord
- Keyword (en)
- American Sign Language Data analysis Interval analysis Linguistic analysis Annotation Interval arithmetic Database Very large databases Bioinformatics Correlation Pruning(tree) Information extraction Data mining Time interval Interest Sign language First depth search
- Keyword (es)
- American Sign Language Análisis datos análisis intervalo Análisis linguístico Anotación Aritmética intervalo Base dato Bioinformática Correlación Poda Extracción información Busca dato Intervalo tiempo Interés Lenguaje por signos Busca profundidad primero
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B07 Memory organisation. Data processing / 001D02B07B Data processing. List processing. Character string processing
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B07 Memory organisation. Data processing / 001D02B07D Information systems. Data bases
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 22140427
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1007/s10115-009-0196-0 
https://dx.doi.org/10.1007/s10115-009-0196-0
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10115-009-0196-0\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:50:\"Mining frequent arrangements of temporal intervals\";s:9:\"\u0000*\u0000jtitle\";s:41:\"Knowledge and information systems (Print)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Knowl. inf. syst. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"21\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"133\";s:8:\"\u0000*\u0000epage\";s:3:\"171\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0219-1377\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"PAPAPETROU\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Panagiotis\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"KOLLIOS, George\";i:1;s:14:\"SCLAROFF, Stan\";i:2;s:20:\"GUNOPULOS, Dimitrios\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:50:\"Mining frequent arrangements of temporal intervals\";s:8:\"\u0000*\u0000place\";s:6:\"London\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"39\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10115-009-0196-0\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:50:\"Mining frequent arrangements of temporal intervals\";s:9:\"\u0000*\u0000jtitle\";s:41:\"Knowledge and information systems (Print)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Knowl. inf. syst. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"21\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"133\";s:8:\"\u0000*\u0000epage\";s:3:\"171\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0219-1377\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"PAPAPETROU\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Panagiotis\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"KOLLIOS, George\";i:1;s:14:\"SCLAROFF, Stan\";i:2;s:20:\"GUNOPULOS, Dimitrios\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:50:\"Mining frequent arrangements of temporal intervals\";s:8:\"\u0000*\u0000place\";s:6:\"London\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"39\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10115-009-0196-0\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10115-009-0196-0\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:50:\"Mining frequent arrangements of temporal intervals\";s:9:\"\u0000*\u0000jtitle\";s:41:\"Knowledge and information systems (Print)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Knowl. inf. syst. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"21\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"133\";s:8:\"\u0000*\u0000epage\";s:3:\"171\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0219-1377\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"PAPAPETROU\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Panagiotis\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"KOLLIOS, George\";i:1;s:14:\"SCLAROFF, Stan\";i:2;s:20:\"GUNOPULOS, Dimitrios\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:50:\"Mining frequent arrangements of temporal intervals\";s:8:\"\u0000*\u0000place\";s:6:\"London\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"39\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10115-009-0196-0\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:50:\"Mining frequent arrangements of temporal intervals\";s:9:\"\u0000*\u0000jtitle\";s:41:\"Knowledge and information systems (Print)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Knowl. inf. syst. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"21\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"133\";s:8:\"\u0000*\u0000epage\";s:3:\"171\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0219-1377\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"PAPAPETROU\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Panagiotis\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"KOLLIOS, George\";i:1;s:14:\"SCLAROFF, Stan\";i:2;s:20:\"GUNOPULOS, Dimitrios\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:50:\"Mining frequent arrangements of temporal intervals\";s:8:\"\u0000*\u0000place\";s:6:\"London\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"39\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10115-009-0196-0\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:50:\"Mining frequent arrangements of temporal intervals\";s:9:\"\u0000*\u0000jtitle\";s:41:\"Knowledge and information systems (Print)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Knowl. inf. syst. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"21\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"133\";s:8:\"\u0000*\u0000epage\";s:3:\"171\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0219-1377\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"PAPAPETROU\";s:10:\"\u0000*\u0000aufirst\";s:10:\"Panagiotis\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"KOLLIOS, George\";i:1;s:14:\"SCLAROFF, Stan\";i:2;s:20:\"GUNOPULOS, Dimitrios\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:50:\"Mining frequent arrangements of temporal intervals\";s:8:\"\u0000*\u0000place\";s:6:\"London\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"39\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
