High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates
- Author
- UNIL YUN1 ; HEUNGMO RYANG1 ; KEUN HO RYU2
[1] Department of Computer Engineering, Sejong University, Seoul, Korea, Republic of
[2] Department of Computer Science, Chungbuk National University, Cheongju, Korea, Republic of - Source
Expert systems with applications. 2014, Vol 41, Num 8, pp 3861-3878, 18 p ; ref : 3/4 p
- ISSN
- 0957-4174
- Scientific domain
- Computer science
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Author keyword
- Candidate pruning Data mining High utility itemsets Single-pass tree construction Utility mining
- Keyword (fr)
- Analyse donnée Arbre graphe Base de données Bourse valeurs Bénéfice Décision collective Elagage Etude marché Evaluation performance Filtrage Fouille donnée Marché valeurs Méthode arborescente Processus métier Structure arborescente Structure donnée Théorie utilité Traitement transaction Base donnée très grande Marché prédictif
- Keyword (en)
- Data analysis Tree(graph) Database Stock exchange Profit Social decision Pruning(tree) Market survey Performance evaluation Filtering Data mining Stock markets Tree structured method Business process Tree structure Data structure Utility theory Transaction processing Very large databases Prediction market
- Keyword (es)
- Análisis datos Arbol grafo Base dato Bolsa valores Beneficio Decisión colectiva Poda Estudio mercado Evaluación prestación Filtrado Busca dato Método arborescente Proceso oficio Estructura arborescente Estructura datos Teoría utilidad Tratamiento transacción Base de datos a gran escala Mercado predictivo
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A08 Decision theory. Utility theory
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A10 Portfolio theory
- 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 Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 28319014
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.1016/j.eswa.2013.11.038 
https://dx.doi.org/10.1016/j.eswa.2013.11.038
"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:26:\"10.1016\/j.eswa.2013.11.038\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Expert systems with applications\";s:9:\"\u0000*\u0000stitle\";s:17:\"Expert syst. appl\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"41\";s:8:\"\u0000*\u0000issue\";s:1:\"8\";s:8:\"\u0000*\u0000spage\";s:4:\"3861\";s:8:\"\u0000*\u0000epage\";s:4:\"3878\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0957-4174\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"UNIL YUN\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"HEUNGMO RYANG\";i:1;s:11:\"KEUN HO RYU\";}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:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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:26:\"10.1016\/j.eswa.2013.11.038\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Expert systems with applications\";s:9:\"\u0000*\u0000stitle\";s:17:\"Expert syst. appl\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"41\";s:8:\"\u0000*\u0000issue\";s:1:\"8\";s:8:\"\u0000*\u0000spage\";s:4:\"3861\";s:8:\"\u0000*\u0000epage\";s:4:\"3878\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0957-4174\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"UNIL YUN\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"HEUNGMO RYANG\";i:1;s:11:\"KEUN HO RYU\";}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:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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:26:\"10.1016\/j.eswa.2013.11.038\";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:26:\"10.1016\/j.eswa.2013.11.038\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Expert systems with applications\";s:9:\"\u0000*\u0000stitle\";s:17:\"Expert syst. appl\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"41\";s:8:\"\u0000*\u0000issue\";s:1:\"8\";s:8:\"\u0000*\u0000spage\";s:4:\"3861\";s:8:\"\u0000*\u0000epage\";s:4:\"3878\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0957-4174\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"UNIL YUN\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"HEUNGMO RYANG\";i:1;s:11:\"KEUN HO RYU\";}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:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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:26:\"10.1016\/j.eswa.2013.11.038\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Expert systems with applications\";s:9:\"\u0000*\u0000stitle\";s:17:\"Expert syst. appl\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"41\";s:8:\"\u0000*\u0000issue\";s:1:\"8\";s:8:\"\u0000*\u0000spage\";s:4:\"3861\";s:8:\"\u0000*\u0000epage\";s:4:\"3878\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0957-4174\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"UNIL YUN\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"HEUNGMO RYANG\";i:1;s:11:\"KEUN HO RYU\";}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:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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:26:\"10.1016\/j.eswa.2013.11.038\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:9:\"\u0000*\u0000jtitle\";s:32:\"Expert systems with applications\";s:9:\"\u0000*\u0000stitle\";s:17:\"Expert syst. appl\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"41\";s:8:\"\u0000*\u0000issue\";s:1:\"8\";s:8:\"\u0000*\u0000spage\";s:4:\"3861\";s:8:\"\u0000*\u0000epage\";s:4:\"3878\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0957-4174\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"UNIL YUN\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:13:\"HEUNGMO RYANG\";i:1;s:11:\"KEUN HO RYU\";}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:103:\"High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";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
