Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Jheng-Nan Huang"'
Autor:
Jheng-Nan Huang, 黃正男
97
Along with the progress of information techniques and the increase of information need, some databases in the real world grow very quickly and their sizes become very huge. If the FP-Growth procedure is directly executed on these databases to
Along with the progress of information techniques and the increase of information need, some databases in the real world grow very quickly and their sizes become very huge. If the FP-Growth procedure is directly executed on these databases to
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/cgac8y
Autor:
Jian-Ming Liau, Tai-Wen Hsu, Sheng-Chu Hung, Wen-Yi Chang, Chien-Heng Wu, Jheng-Nan Huang, Chia-Ying Tu, Chuan-Yiao Lin, Yu-Feng Chung, Whey-Fone Tsai, Chih-Yu Kuo
Publikováno v:
Journal of the Chinese Institute of Engineers. 44:532-543
At the Changhwa Fuhai wind farm, the high-resolution numerical models for wind, wave and current simulations are crucial to provide daily forecasts as a decision-support system for Taiwan’s offshor...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07489f0bd1692af70533b051065cf85a
https://doi.org/10.1080/02533839.2021.1936643
https://doi.org/10.1080/02533839.2021.1936643
Publikováno v:
Intelligent Data Analysis. 2017, Vol. 21 Issue 3, p597-616. 20p. 5 Diagrams, 2 Charts, 8 Graphs.
Publikováno v:
Intelligent Data Analysis. 21:597-616
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19a6b76f5343e963da38dd70978624ee
https://doi.org/10.3233/ida-150488
https://doi.org/10.3233/ida-150488
Publikováno v:
Soft Computing. 21:6143-6157
Deriving frequent itemsets from databases is an important research issue in data mining. The number of frequent itemsets may be unusually large when a low minimum support threshold is given. As such, the design of a compact representation to compress
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::447626020bf7081d10f267a99578ea85
https://doi.org/10.1007/s00500-016-2172-4
https://doi.org/10.1007/s00500-016-2172-4
Publikováno v:
SMC
When a mining procedure is directly executed on very large databases, the computer memory may not allow the processing in memory. In the past, we adopted a branch-and-bound search strategy to divide the domain items as a set of groups. Although it wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61f5f96dbbd10dd0ece6b078c927ff6d
https://doi.org/10.1109/icsmc.2011.6084010
https://doi.org/10.1109/icsmc.2011.6084010
Publikováno v:
2011 IEEE International Conference on Systems, Man & Cybernetics (SMC); 2011, p2238-2242, 5p