By Mani Abedini, Michael Kirley (auth.), Dianhui Wang, Mark Reynolds (eds.)

This booklet constitutes the refereed lawsuits of the twenty fourth Australasian Joint convention on synthetic Intelligence, AI 2011, held in Perth, Australia, in December 2011. The eighty two revised complete papers offered have been rigorously reviewed and chosen from 193 submissions. The papers are geared up in topical sections on information mining and information discovery, laptop studying, evolutionary computation and optimization, clever agent structures, common sense and reasoning, imaginative and prescient and images, photo processing, ordinary language processing, cognitive modeling and simulation expertise, and AI applications.

Show description

Read Online or Download AI 2011: Advances in Artificial Intelligence: 24th Australasian Joint Conference, Perth, Australia, December 5-8, 2011. Proceedings PDF

Similar nonfiction_5 books

Principles and Practice of Pediatric Infectious Disease, 3rd Edition

Speedy locate the knowledge you want to comprehend a medical challenge, diagnose it adequately, and supply applicable administration! This reference deals the most recent need-to-know info due to an easy-to-access structure. .. permitting you to spend extra time together with your sufferers and not more time looking for solutions.

Additional resources for AI 2011: Advances in Artificial Intelligence: 24th Australasian Joint Conference, Perth, Australia, December 5-8, 2011. Proceedings

Sample text

However, by exploiting the symmetry of Euclidean distance ([4]), that means D(A, B) = D(B, A), we can prune off a half of the distance computations by storing D(A, B) and reusing the value when it is necessary to find D(B, A). Therefore, the algorithm only needs to compute and save m(m-1)/2 distance values. Motif-Based Method for Initialization the K-Means Clustering for Time Series Data 15 Exploiting Triangular Inequality and Reference Point In order to check whether two subsequences Ca and Cb are non-trivial matches, the brute-force algorithm has to check if D(Ca, Cb) is greater than a given range R (R > 0) or not rather than to compute a real value for this distance.

Thus, if we want to check whether D(Ca, Cb) ≥ R , we only need to look at D(Q, Ca) – D(Q, Cb). If D(Q, Ca) – D(Q, Cb) ≥ R, we can conclude that D(Ca, Cb) ≥ R since D(Ca, Cb) ≥ D(Q, Ca) – D(Q, Cb). When applying reference point technique, we have to deal with the problem how to select an appropriate reference subsequence Q. To apply the triangular inequality for a tighter checking, we should select one subsequence Q to be reference subsequence such that the difference D(Q, Ca) – D(Q, Cb) gets the large value.

When applying reference point technique, we have to deal with the problem how to select an appropriate reference subsequence Q. To apply the triangular inequality for a tighter checking, we should select one subsequence Q to be reference subsequence such that the difference D(Q, Ca) – D(Q, Cb) gets the large value. Hence, in this work we choose a subsequence Q which stays outside of all the other subsequences as reference subsequence. For more details about the reference point technique, interested readers can refer to [9].

Download PDF sample

AI 2011: Advances in Artificial Intelligence: 24th by Mani Abedini, Michael Kirley (auth.), Dianhui Wang, Mark
Rated 4.34 of 5 – based on 44 votes