List of Titles

Authors: Tang, Long , Chetty, Madhu , Lim, Suryani
Date: 2011
Type: Text , Conference paper
Relation: 18th International Conference on Neural Information Processing, ICONIP 2011; Shanghai; China; 13th to 17th November 2011; published in Neural Information Processing, (Lecture Notes in Computer Science series) Vol. 7062 (1) p.36-47
Full Text: false
Reviewed:
Description: Carbon trading scheme is being established around the world as an instrument in reducing global GHG emission. Being an emerging market, there only a few simple simulation studies related to carbon trading that have been reported. In this paper, we propose a novel carbon trading simulator capable of modeling traits of human traders in carbon markets. The model is driven by the concept of Nash equilibrium within an agent based modeling paradigm. The model is capable of implementing crucial issues such as carbon emissions, Marginal Abatement Cost Curve (MAC), and complex human trading behaviour. Experiments carried out provide insights into interaction between traders’ behaviour and how the interaction affects profitability
Description: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, Vol.7064 (3)

Authors: Nguyen, Vinh , Chetty, Madhu , Coppel, Ross , Wangikar, Prangipar
Date: 2011
Type: Text , Conference paper
Relation: 18th International Conference, ICONIP 2011. Shanghai, China, 13th-17th November, 2011 In Neural Information Processing. ICONIP 2011 (Lecture Notes in Computer Science) vol 7064. p 719-729
Full Text: false
Reviewed:
Description: This paper is concerned with the problem of learning the globally optimal structure of a dynamic Bayesian network (DBN). We propose using a recently introduced information theoretic criterion named MIT (Mutual Information Test) for evaluating the goodness-of-fit of the DBN structure. MIT has been previously shown to be effective for learning static Bayesian network, yielding results competitive to other popular scoring metrics, such as BIC/MDL, K2 and BD, and the well-known constraint-based PC algorithm. This paper adapts MIT to the case of DBN. Using a modified variant of MIT, we show that learning the globally optimal DBN structure can be efficiently achieved in polynomial time.
Description: Lecture Notes in Computer Science, vol 7064.

Showing items 1 - 2 of 2