乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:26:02Z","timestamp":1648563962786},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2014,7,30]],"date-time":"2014-07-30T00:00:00Z","timestamp":1406678400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s11042-014-2178-9","type":"journal-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T04:47:16Z","timestamp":1406609236000},"page":"4887-4912","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Updating high-utility pattern trees with transaction modification"],"prefix":"10.1007","volume":"75","author":[{"given":"Chun-Wei","family":"Lin","sequence":"first","affiliation":[]},{"given":"Binbin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wensheng","family":"Gan","sequence":"additional","affiliation":[]},{"given":"Bo-Wei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Seungmin","family":"Rho","sequence":"additional","affiliation":[]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,30]]},"reference":[{"key":"2178_CR1","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-642-13577-4_28","volume":"6059","author":"Z Abdullah","year":"2010","unstructured":"Abdullah Z, Herawan T, Deris M (2010) Mining significant least association rules using fast slp-growth algorithm. Lect Notes Comput Sci 6059:324\u2013336","journal-title":"Lect Notes Comput Sci"},{"key":"2178_CR2","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Database mining: a performance perspective. IEEE Trans Knowl Data Eng 5:914\u2013925","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2178_CR3","unstructured":"Agrawal R, Srikant R (1994) \u201cFast algorithms for mining association rules in large databases.\u201d The Int Conf Very Large Data Bases: 487\u2013499"},{"key":"2178_CR4","unstructured":"Chan R, Yang Q, Shen YD (2003) \u201cMining high utility itemsets,\u201d IEEE Int Conf Data Min: 19\u201326"},{"key":"2178_CR5","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/69.553155","volume":"8","author":"MS Chen","year":"1996","unstructured":"Chen MS, Han J, Yu PS (1996) Data mining: an overview from a database perspective. IEEE Trans Knowl Data Eng 8:866\u2013883","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2178_CR6","doi-asserted-by":"crossref","unstructured":"Cheung DWL, Han J, Ng V, Wong CY (1996) \u201cMaintenance of discovered association rules in large databases: An incremental updating technique.\u201d Int Conf Data Eng:106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"2178_CR7","doi-asserted-by":"crossref","unstructured":"Cheung DWL, Lee SD, Kao B (1997) \u201cA general incremental technique for maintaining discovered association rules.\u201d The Int Conf Database Syst Adv Appl: 185\u2013194","DOI":"10.1142\/9789812819536_0020"},{"key":"2178_CR8","unstructured":"Frequent itemset mining dataset repository. Available: http:\/\/fimi.ua.ac.be\/data\/ (2012)"},{"key":"2178_CR9","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.datak.2010.03.002","volume":"69","author":"TF Gharib","year":"2010","unstructured":"Gharib TF, Nassar H, Taha M, Abrahamd A (2010) An efficient algorithm for incremental mining of temporal association rules. Data Knowl Eng 69:800\u2013815","journal-title":"Data Knowl Eng"},{"key":"2178_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Disc 8:53\u201387","journal-title":"Data Min Knowl Disc"},{"key":"2178_CR11","doi-asserted-by":"crossref","first-page":"2424","DOI":"10.1016\/j.eswa.2007.04.009","volume":"34","author":"TP Hong","year":"2008","unstructured":"Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34:2424\u20132435","journal-title":"Expert Syst Appl"},{"key":"2178_CR12","first-page":"2875","volume":"4","author":"TP Hong","year":"2008","unstructured":"Hong TP, Lin CW, Wu YL (2008) \u201cAn efficient fufp-tree mainteance algorithm for record modification,\u201d. Int J Innov Comput Inf Control 4:2875\u20132887","journal-title":"Int J Innov Comput Inf Control"},{"key":"2178_CR13","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/11540007_67","volume":"3614","author":"YC Li","year":"2005","unstructured":"Li YC, Yeh JS, Chang CC (2005) Direct candidates generation: a novel algorithm for discovering complete share-frequent itemsets. Fuzzy Syst Knowl Discov 3614:551\u2013560","journal-title":"Fuzzy Syst Knowl Discov"},{"key":"2178_CR14","doi-asserted-by":"crossref","unstructured":"Li YC, Yeh JS, Chang CC (2005) \u201cDirect candidates generation: A novel algorithm for discovering complete share-frequent itemsets.\u201d Lect Notes Comput Sci: 551\u2013560","DOI":"10.1007\/11540007_67"},{"key":"2178_CR15","doi-asserted-by":"crossref","unstructured":"Li YC, Yeh JS, Chang CC (2005) \u201cA fast algorithm for mining share-frequent itemsets.\u201d Lect Notes Comput Sci: 417\u2013428","DOI":"10.1007\/978-3-540-31849-1_41"},{"key":"2178_CR16","doi-asserted-by":"crossref","first-page":"9498","DOI":"10.1016\/j.eswa.2008.03.014","volume":"36","author":"CW Lin","year":"2009","unstructured":"Lin CW, Hong TP, Lu WH (2009) The pre-fufp algorithm for incremental mining. Expert Syst Appl 36:9498\u20139505","journal-title":"Expert Syst Appl"},{"key":"2178_CR17","doi-asserted-by":"crossref","unstructured":"Lin CW, Hong TP, Lu WH (2010) \u201cMaintaining high utility pattern trees in dynamic databases.\u201d Int Conf Comput Eng Appl: 304\u2013308","DOI":"10.1109\/ICCEA.2010.67"},{"key":"2178_CR18","doi-asserted-by":"crossref","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"CW Lin","year":"2011","unstructured":"Lin CW, Hong TP, Lu WH (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38:7419\u20137424","journal-title":"Expert Syst Appl"},{"key":"2178_CR19","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1007\/978-94-007-7262-5_112","volume":"260","author":"CW Lin","year":"2014","unstructured":"Lin CW, Lan GC, Hong TP, Kong L (2014) Mining high utility itemsets based on transaction deletion. Lect Notes Electr Eng 260:983\u2013990","journal-title":"Lect Notes Electr Eng"},{"key":"2178_CR20","doi-asserted-by":"crossref","first-page":"7173","DOI":"10.1016\/j.eswa.2012.01.072","volume":"39","author":"CW Lin","year":"2012","unstructured":"Lin CW, Lan GC, Hong TP (2012) An incremental mining algorithm for high utility itemsets. Expert Syst Appl 39:7173\u20137180","journal-title":"Expert Syst Appl"},{"key":"2178_CR21","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) \u201cA two-phase algorithm for fast discovery of high utility itemsets.\u201d Adv Knowl Discov Data Min: 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"2178_CR22","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) \u201cMining high utility itemsets without candidate generation>\u201d ACM Int Conf Inf Knowl Manag: 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"2178_CR23","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K, Fung BCM (2012) \u201cDirect discovery of high utility itemsets without candidate generation.\u201d IEEE Int Conf Data Min: 984\u2013989","DOI":"10.1109\/ICDM.2012.20"},{"key":"2178_CR24","unstructured":"Microsoft. Example database foodmart of microsoft analysis services. Available: http:\/\/msdn.microsoft.com\/en-us\/library\/aa217032(SQL.80).aspx"},{"key":"2178_CR25","doi-asserted-by":"crossref","unstructured":"Nath B, Bhattacharyya DK, Ghosh A (2013) \u201cIncremental association rule mining: A survey,\u201d WIREs Data Mining Knowledge Discovery, vol. 3","DOI":"10.1002\/widm.1086"},{"key":"2178_CR26","unstructured":"Song W, Liu Y, Li J (2013) \u201cMining high utility itemsets by dynamically pruning the tree structure.\u201d Appl Intell: 1\u201315"},{"key":"2178_CR27","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Bai-En S, Cheng-Wei W, Yu PS (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25:1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2178_CR28","unstructured":"Wu CW, Lin YF, Yu PS, Tseng VS (2013) \u201cMining high utility episodes in complex event sequences.\u201d ACM Int Conf Knowl Discov Data Min: 536\u2013544"},{"key":"2178_CR29","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59:603\u2013626","journal-title":"Data Knowl Eng"},{"key":"2178_CR30","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) \u201cA foundational approach to mining itemset utilities from databases.\u201d SIAM Int Conf Data Min: 211\u2013225","DOI":"10.1137\/1.9781611972740.51"},{"key":"2178_CR31","doi-asserted-by":"crossref","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","volume":"41","author":"U Yuna","year":"2014","unstructured":"Yuna U, Ryanga H, Ryub KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41:3861\u20133878","journal-title":"Expert Syst Appl"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-014-2178-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-014-2178-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-014-2178-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T04:38:46Z","timestamp":1565671126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-014-2178-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,30]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["2178"],"URL":"https:\/\/doi.org\/10.1007\/s11042-014-2178-9","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,30]]}}}