Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11861/7596
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shum, Wing-Ho | en_US |
dc.contributor.author | Prof. LEUNG Kwong Sak | en_US |
dc.contributor.author | Wong, Man-Leung | en_US |
dc.date.accessioned | 2023-03-27T03:10:46Z | - |
dc.date.available | 2023-03-27T03:10:46Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Proceedings - IEEE International Conference on Data Mining, ICDM, 2005, pp. 394 - 401, Article number 1565704 | en_US |
dc.identifier.isbn | 0769522785 | - |
dc.identifier.isbn | 978-076952278-4 | - |
dc.identifier.issn | 15504786 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11861/7596 | - |
dc.description.abstract | Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle discrete values only; it cannot handle continuous, interval and ordinal ones, which must be converted to discrete values and the order information is lost. Thus, BN tends to have higher network complexity and lower understandability. In this paper, we present a novel dependency network which can handle discrete, continuous, interval and ordinal values through functions; it has lower network complexity and stronger expressive power; it can represent any kind of relationships; and it can incorporate a-priori knowledge though user-defined functions. We also propose a novel Genetic Programming (GP) to learn dependency networks. The novel GP does not use any knowledge-guided nor application-oriented operator, thus it is robust and easy to replicate. The experimental results demonstrate that the novel GP can successfully discover the target novel dependency networks, which have the highest accuracy and the lowest network complexity. © 2005 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Proceedings - IEEE International Conference on Data Mining, ICDM | en_US |
dc.title | Learning functional dependency networks based on genetic programming | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.doi | 10.1109/ICDM.2005.86 | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Department of Applied Data Science | - |
Appears in Collections: | Applied Data Science - Publication |
SCOPUSTM
Citations
1
checked on Nov 17, 2024
Page view(s)
34
Last Week
1
1
Last month
checked on Nov 21, 2024
Google ScholarTM
Impact Indices
Altmetric
PlumX
Metrics
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.