Zobrazeno 1 - 9
of 9
pro vyhledávání: '"PAI-CHOU WANG"'
Publikováno v:
Review of Economic and Business Studies, Vol 11, Iss 2, Pp 33-48 (2018)
This paper identified the relevance of several publication’s characteristics of each publication in reaching more people through organic strategy using Support Vector Machines. Before finding the relevance of several inputs, 10 potential models wer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::112d97b1b0907a79b3d91f7213788e11
https://doi.org/10.1515/rebs-2018-0072
https://doi.org/10.1515/rebs-2018-0072
Autor:
Pai-Chou Wang
Publikováno v:
International Journal of Foundations of Computer Science. 25:219-246
Reducts preserve original classification properties using minimal number of attributes in a table. Dynamic reducts are the most stable reducts in the process of random sampling of original decision table, and they are proposed to classify unseen case
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9adf956d4c2908ea1d1b0a196ea17ab8
https://doi.org/10.1142/s0129054114500117
https://doi.org/10.1142/s0129054114500117
Publikováno v:
Review of Economic & Business Studies; Dec2018, Vol. 11 Issue 2, p33-48, 16p
Autor:
Pai-Chou Wang
Publikováno v:
GrC
Approximate reduct relaxes the requirement for the discernibility preserving and it can be applied to generate approximate decision rules. To compute such reducts, discernibility matrix and sorting are commonly used and they take O(mn2) and O(m2n log
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6cf69859d7cb5a35f3ebee4c58e44af
https://doi.org/10.1109/grc.2011.6122683
https://doi.org/10.1109/grc.2011.6122683
Autor:
Pai-Chou Wang
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642162473
Dynamic reducts with large stability coefficients are good candidates for decision rules generation but it is time consuming to generate them. This paper presents an algorithm dReducts using a cascading hash function to generate (F, e)-dynamic reduct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05be97b2d4d1699d10dd47b08b9d24a3
https://doi.org/10.1007/978-3-642-16248-0_14
https://doi.org/10.1007/978-3-642-16248-0_14
Autor:
Hsien-Kuang Chiou, Pai-Chou Wang
Publikováno v:
Rough Sets and Knowledge Technology ISBN: 9783540724575
RSKT
RSKT
Reducts are applied to represent the knowledge without superfluous attributes in rough set. In this paper, a two-phase β-certain reducts generation is developed to preserve the original classification of each decision class in the table under the ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a3d5ff486d4fcc2d4a2dfbef363d7c3
https://doi.org/10.1007/978-3-540-72458-2_48
https://doi.org/10.1007/978-3-540-72458-2_48
Autor:
W. Korfhage, Pai-Chou Wang
Publikováno v:
SPDP
This paper presents a genetic algorithm using a matrix genome encoding to schedule distributed tasks, represented by a directed acyclic graph, on processors in order to minimize the maximum task finishing time. Our experimental results show that this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3a1f6e2d4798bae70aa6cbf21d22f16
https://doi.org/10.1109/spdp.1995.530742
https://doi.org/10.1109/spdp.1995.530742
Autor:
Pai-Chou Wang, Korfhage, W.
Publikováno v:
Proceedings Seventh IEEE Symposium on Parallel & Distributed Processing; 1995, p638-641, 4p
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.