<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>General</title>
<link href="http://hdl.handle.net/10453/11566" rel="alternate"/>
<subtitle/>
<id>http://hdl.handle.net/10453/11566</id>
<updated>2013-05-23T05:46:05Z</updated>
<dc:date>2013-05-23T05:46:05Z</dc:date>
<entry>
<title>Classification Techniques in Pattern Recognition</title>
<link href="http://hdl.handle.net/10453/12099" rel="alternate"/>
<author>
<name>Zheng Lihong</name>
</author>
<author>
<name>He Xiangjian</name>
</author>
<id>http://hdl.handle.net/10453/12099</id>
<updated>2012-10-22T01:08:57Z</updated>
<published>2005-01-01T00:00:00Z</published>
<summary type="text">Classification Techniques in Pattern Recognition
Zheng Lihong; He Xiangjian
Vaclav Skala
In this paper, we review some pattern recognition schemes published in recent years. After giving the general processing steps of pattern recognition, we discuss several methods used for steps of pattern recognition such as Principal Component Analysis (PCA) in feature extraction, Support Vector Machines (SVM) in classification, and so forth. Different kinds of merits are presented and their applications on pattern precognition are given. The objective of this paper is to summarize and compare some of the methods for pattern recognition, and future research issues which need to be resolved and investigated further are given along with the new trends and ideas.
</summary>
<dc:date>2005-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Evaluation of the Northern Territory Library's Libraries and Knowledge Centres Model</title>
<link href="http://hdl.handle.net/10453/12098" rel="alternate"/>
<author>
<name>Nakata Nicholas</name>
</author>
<author>
<name>Nakata Victoria</name>
</author>
<author>
<name>Anderson Jane</name>
</author>
<author>
<name>Hart Victor</name>
</author>
<author>
<name>Hunter Jane</name>
</author>
<author>
<name>Smallacombe Sonia</name>
</author>
<author>
<name>Richmond Cate</name>
</author>
<author>
<name>Lloyd Brian</name>
</author>
<author>
<name>Maynard Gibby</name>
</author>
<id>http://hdl.handle.net/10453/12098</id>
<updated>2010-06-16T05:02:18Z</updated>
<published>2006-01-01T00:00:00Z</published>
<summary type="text">Evaluation of the Northern Territory Library's Libraries and Knowledge Centres Model
Nakata Nicholas; Nakata Victoria; Anderson Jane; Hart Victor; Hunter Jane; Smallacombe Sonia; Richmond Cate; Lloyd Brian; Maynard Gibby

Evaluation of the  Northern Territory Library's  model for Libraries and Knowledge Centres in Indigenous communities.
</summary>
<dc:date>2006-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>A human-friendly MAS for mining stock data</title>
<link href="http://hdl.handle.net/10453/2763" rel="alternate"/>
<author>
<name>Ni Jiarui</name>
</author>
<author>
<name>Zhang Chengqi</name>
</author>
<id>http://hdl.handle.net/10453/2763</id>
<updated>2010-08-26T03:28:10Z</updated>
<published>2006-01-01T00:00:00Z</published>
<summary type="text">A human-friendly MAS for mining stock data
Ni Jiarui; Zhang Chengqi
Butz, C; Nguyen, T; Takama, Y; Cheung, W; Cheung, Y
Mining stock data can be beneficial to the participants&#13;
and researchers in the stock market. However, it is very difficult&#13;
for a normal trader or researcher to apply data mining&#13;
techniques to the data on his own due to the complexity&#13;
involved in the whole data mining process. In this paper,&#13;
we present a multi-agent system that can help users easily&#13;
deal with their data mining jobs on stock data. This system&#13;
guides users to specify their mining tasks by simply specifying&#13;
the data sets to be mined and selecting pre-defined&#13;
and/or user-added data mining agents. This approach offers&#13;
normal traders a practical and flexible solution to mining&#13;
stock data.
</summary>
<dc:date>2006-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Efficient frequent itemsets mining by sampling</title>
<link href="http://hdl.handle.net/10453/2756" rel="alternate"/>
<author>
<name>Zhang Chengqi</name>
</author>
<author>
<name>Zhao Yanchang</name>
</author>
<author>
<name>Zhang Shichao</name>
</author>
<id>http://hdl.handle.net/10453/2756</id>
<updated>2010-08-26T03:06:12Z</updated>
<published>2006-01-01T00:00:00Z</published>
<summary type="text">Efficient frequent itemsets mining by sampling
Zhang Chengqi; Zhao Yanchang; Zhang Shichao
Li, Y; Looi, M; Zhong, N
As the first stage for discovering association rules, frequent itemsets&#13;
mining is an important challenging task for large databases. Sampling provides an&#13;
efficient way to get approximating answers in much shorter time. Based on the&#13;
characteristics of frequent itemsets counting, a new bound for sampling is&#13;
proposed, with which less samples are necessary to achieve the required accuracy&#13;
and the efficiency is much improved over traditional Chernoff bounds.
</summary>
<dc:date>2006-01-01T00:00:00Z</dc:date>
</entry>
</feed>
