Algorithms for Storytelling
- Author
- KUMAR, Deept1 ; RAMAKRISHNAN, Naren2 ; HELM, Richard F3 ; POTTS, Malcolm3
[1] Feeva Technology, 500 Howard Street, Suite 425, San Fransisco, CA 94105, United States
[2] Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, United States
[3] Department of Biochemistry, Virginia Tech, Blacksburg, VA 24061, United States - Source
IEEE transactions on knowledge and data engineering. 2008, Vol 20, Num 6, pp 736-751, 16 p ; ref : 23 ref
- ISSN
- 1041-4347
- Scientific domain
- Control theory, operational research; Computer science; Psychology, psychopathology, psychiatry
- Publisher
- IEEE Computer Society, New York, NY
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- Data mining graph and tree search strategies mining methods and algorithms retrieval models
- Keyword (fr)
- Analyse donnée Arbre recherche Base donnée très grande Bioinformatique Dictionnaire Extraction information Fouille donnée Modélisation Narration Ramification Recouvrement Stratégie recherche Vocabulaire
- Keyword (en)
- Data analysis Search tree Very large databases Bioinformatics Dictionaries Information extraction Data mining Modeling Narrative Branching Overlay Search strategy Vocabulary
- Keyword (es)
- Análisis datos Arbol investigación Bioinformática Diccionario Extracción información Busca dato Modelización Narración Ramificación Recubrimiento Estrategia investigación Vocabulario
- Classification
- 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
- 002 Biological and medical sciences / 002A Fundamental and applied biological sciences. Psychology / 002A01 General aspects / 002A01B Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects)
- Discipline
- Biological sciences. Generalities. Modelling. Methods Computer science : theoretical automation and systems Generalities in biological sciences
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 20340725
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.1109/TKDE.2008.32 
https://dx.doi.org/10.1109/TKDE.2008.32
"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:20:\"10.1109\/TKDE.2008.32\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:27:\"Algorithms for Storytelling\";s:9:\"\u0000*\u0000jtitle\";s:51:\"IEEE transactions on knowledge and data engineering\";s:9:\"\u0000*\u0000stitle\";s:27:\"IEEE trans. knowl. data eng\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"20\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"736\";s:8:\"\u0000*\u0000epage\";s:3:\"751\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1041-4347\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"KUMAR\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Deept\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"RAMAKRISHNAN, Naren\";i:1;s:15:\"HELM, Richard F\";i:2;s:14:\"POTTS, Malcolm\";}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:27:\"Algorithms for Storytelling\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:21:\"IEEE Computer Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";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:20:\"10.1109\/TKDE.2008.32\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:27:\"Algorithms for Storytelling\";s:9:\"\u0000*\u0000jtitle\";s:51:\"IEEE transactions on knowledge and data engineering\";s:9:\"\u0000*\u0000stitle\";s:27:\"IEEE trans. knowl. data eng\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"20\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"736\";s:8:\"\u0000*\u0000epage\";s:3:\"751\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1041-4347\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"KUMAR\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Deept\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"RAMAKRISHNAN, Naren\";i:1;s:15:\"HELM, Richard F\";i:2;s:14:\"POTTS, Malcolm\";}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:27:\"Algorithms for Storytelling\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:21:\"IEEE Computer Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";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:20:\"10.1109\/TKDE.2008.32\";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:20:\"10.1109\/TKDE.2008.32\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:27:\"Algorithms for Storytelling\";s:9:\"\u0000*\u0000jtitle\";s:51:\"IEEE transactions on knowledge and data engineering\";s:9:\"\u0000*\u0000stitle\";s:27:\"IEEE trans. knowl. data eng\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"20\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"736\";s:8:\"\u0000*\u0000epage\";s:3:\"751\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1041-4347\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"KUMAR\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Deept\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"RAMAKRISHNAN, Naren\";i:1;s:15:\"HELM, Richard F\";i:2;s:14:\"POTTS, Malcolm\";}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:27:\"Algorithms for Storytelling\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:21:\"IEEE Computer Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";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:20:\"10.1109\/TKDE.2008.32\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:27:\"Algorithms for Storytelling\";s:9:\"\u0000*\u0000jtitle\";s:51:\"IEEE transactions on knowledge and data engineering\";s:9:\"\u0000*\u0000stitle\";s:27:\"IEEE trans. knowl. data eng\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"20\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"736\";s:8:\"\u0000*\u0000epage\";s:3:\"751\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1041-4347\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"KUMAR\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Deept\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"RAMAKRISHNAN, Naren\";i:1;s:15:\"HELM, Richard F\";i:2;s:14:\"POTTS, Malcolm\";}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:27:\"Algorithms for Storytelling\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:21:\"IEEE Computer Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";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:20:\"10.1109\/TKDE.2008.32\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:27:\"Algorithms for Storytelling\";s:9:\"\u0000*\u0000jtitle\";s:51:\"IEEE transactions on knowledge and data engineering\";s:9:\"\u0000*\u0000stitle\";s:27:\"IEEE trans. knowl. data eng\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"20\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"736\";s:8:\"\u0000*\u0000epage\";s:3:\"751\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1041-4347\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"KUMAR\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Deept\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"RAMAKRISHNAN, Naren\";i:1;s:15:\"HELM, Richard F\";i:2;s:14:\"POTTS, Malcolm\";}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:27:\"Algorithms for Storytelling\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:21:\"IEEE Computer Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";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
