<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>e-space Collection:</title>
    <link>http://hdl.handle.net/2173/31802</link>
    <description />
    <pubDate>Tue, 21 May 2013 16:14:11 GMT</pubDate>
    <dc:date>2013-05-21T16:14:11Z</dc:date>
    <item>
      <title>Computational simulation as theoretical experiment</title>
      <link>http://hdl.handle.net/2173/87780</link>
      <description>Title: Computational simulation as theoretical experiment
Authors: Edmonds, Bruce
Abstract: Agent-based simulation can help establish the possibility and characteristics of emergent processes. However the simulation is meaningless without an accompanying interpretation. We argue that the original context needs to be carried with the simulation so as to limit excess generalization from such models. The simulation becomes a theoretical experiment which mediates between observations of the phenomena and natural language descriptions. Replication and exploration of simulations can start to identify the extent of their validity, and thus pave the way for cautions and limited generalization of results. This is illustrated by reimplementing and re-examining two established models. Schelling's model of racial segregation is shown to give counter-intuitive results when pushed out of its intended context—the domain of valid interpretation is narrower than that covered by the whole the model. Takahashi's model of generalized exchange is shown to have included unnecessary assumptions. In this case the domain of valid interpretation is wider than the model (at least in this aspect). A tag-based variation is described where generalized exchange is shown to emerge without information about the past behavior of others.
Description: This article was originally published following peer-review in Journal of Mathematical Sociology, published by and copyright Taylor &amp; Francis Inc.</description>
      <pubDate>Fri, 01 Jul 2005 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2173/87780</guid>
      <dc:date>2005-07-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>An approach for measuring semantic similarity between words using multiple information sources</title>
      <link>http://hdl.handle.net/2173/81276</link>
      <description>Title: An approach for measuring semantic similarity between words using multiple information sources
Authors: Li, Yuhua; Bandar, Zuhair A.; McLean, David A.
Abstract: Semantic similarity between words is becoming a generic problem for many applications of computational linguistics and artificial intelligence. This paper explores the determination of semantic similarity by a number of information sources, which consist of structural semantic information from a lexical taxonomy and information content from a corpus. To investigate how information sources could be used effectively, a variety of strategies for using various possible information sources are implemented. A new measure is then proposed which combines information sources nonlinearly. Experimental evaluation against a benchmark set of human similarity ratings demonstrates that the proposed measure significantly outperforms traditional similarity measures.
Description: Full-text of this article is not available in this e-prints service. This article was originally published following peer-review in IEEE Transactions on Knowledge and Data Engineering, published by and copyright IEEE.</description>
      <pubDate>Wed, 01 Jan 2003 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2173/81276</guid>
      <dc:date>2003-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Electronic roads: intelligent navigation through multi-contextual information</title>
      <link>http://hdl.handle.net/2173/74214</link>
      <description>Title: Electronic roads: intelligent navigation through multi-contextual information
Authors: Fakas, George; Kakas, Antonis; Schizas, Christos
Abstract: This paper proposes a model for intelligent navigation through multi-contextual information that could form electronic roads in the information society. This paper aims to address the problem of electronic information roads, define their notion and the technical form they can take as well as present the tools developed for implementing such a system. The main objective of the proposed model is to give the traveler the capability of exploring the information space in a natural way where the information offered will remain continuously interesting. The system offers links to information in a dynamic and adaptive way. This is achieved by employing intelligent navigation techniques, which combine user profiling and meta-data. Electronic roads emphasize the presentation of multi-contextual information, i.e., information that is semantically related but of different nature at different locations and time. An electronic road is the user’s navigation path through a series of information units. Information units are the building blocks of the available cultural information content.
Description: The original publication is available at http://www.springer.com/</description>
      <pubDate>Thu, 01 Jan 2004 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2173/74214</guid>
      <dc:date>2004-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Decision tree extraction from trained neural networks</title>
      <link>http://hdl.handle.net/2173/31354</link>
      <description>Title: Decision tree extraction from trained neural networks
Authors: Dancey, Darren; McLean, David A.; Bandar, Zuhair A.
Abstract: Artificial Neural Networks (ANNs) have proved both a popular&#xD;
and powerful technique for pattern recognition tasks in&#xD;
a number of problem domains. However, the adoption of&#xD;
ANNs in many areas has been impeded, due to their inability&#xD;
to explain how they came to their conclusion, or show in&#xD;
a readily comprehendible form the knowledge they have obtained.&#xD;
This paper presents an algorithm that addresses these problems.&#xD;
The algorithm achieves this by extracting a Decision&#xD;
Tree, a graphical and easily understood symbolic representation&#xD;
of a decision process, from a trained ANN. The algorithm&#xD;
does not make assumptions about the ANN’s architecture or&#xD;
training algorithm; therefore, it can be applied to any type of&#xD;
ANN. The algorithm is empirically compared with Quinlan’s&#xD;
C4.5 (a common Decision Tree induction algorithm) using&#xD;
standard benchmark datasets. For most of the datasets used&#xD;
in the evaluation, the new algorithm is shown to extract Decision&#xD;
Trees that have a higher predictive accuracy than those&#xD;
induced using C4.5 directly.
Description: This paper was originally presented at the 17th International FLAIRS Conference, Florida, United States, 17-19 May 2004.</description>
      <pubDate>Sat, 01 May 2004 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2173/31354</guid>
      <dc:date>2004-05-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

