東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Advances in data compression and pat...

Rueda, Luis Gabriel.

FindBook

Google Book

Amazon

博客來

Advances in data compression and pattern recognition.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Advances in data compression and pattern recognition./
作者:	Rueda, Luis Gabriel.
面頁冊數:	314 p.
附註:	Adviser: J. Oommen.
Contained By:	Dissertation Abstracts International63-09B
標題:	Computer Science -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NQ71947
ISBN:	0612719472

Advances in data compression and pattern recognition.
Rueda, Luis Gabriel.

Advances in data compression and pattern recognition. - 314 p.

Adviser: J. Oommen.

Thesis (Ph.D.)--Carleton University (Canada), 2002.

In this thesis, we present our contributions to two important areas of <italic>computer science</italic>, namely <italic>data compression </italic> and <italic>pattern recognition</italic>.

ISBN: 0612719472Subjects--Topical Terms:

890869
Computer Science

Advances in data compression and pattern recognition.
LDR:03241nam 2200325 a 45 001 936680
005 20110510
008 110510s2002 eng d
020 $a 0612719472
035 $a (UnM)AAINQ71947
035 $a AAINQ71947
040 $a UnM $c UnM
100 1 $a Rueda, Luis Gabriel. $3 1260495
245 1 0 $a Advances in data compression and pattern recognition.
300 $a 314 p.
500 $a Adviser: J. Oommen.
500 $a Source: Dissertation Abstracts International, Volume: 63-09, Section: B, page: 4254.
502 $a Thesis (Ph.D.)--Carleton University (Canada), 2002.
520 $a In this thesis, we present our contributions to two important areas of <italic>computer science</italic>, namely <italic>data compression </italic> and <italic>pattern recognition</italic>.
520 $a In the area of data compression, we introduce an enhanced version of the static Fano coding, based on the concept of the rearrangement of two lists. The algorithm is formally analyzed and rigorously tested empirically. Its superiority over other similar algorithms has been demonstrated.
520 $a We introduce a greedy algorithm for the adaptive Fano coding. We formalize the partitioning algorithms for the multi-symbol input and the binary output. The empirical results on the well-known benchmarks demonstrate the advantageous properties of our greedy algorithm. This greedy algorithm has also been extended for the multi-symbol output alphabet.
520 $a We also present a more efficient algorithm which uses a new tree structure derived from the binary search tree, namely the Fano binary search tree. This new scheme, the corresponding tree-based operators, and the conditional shifting heuristic used to consistently maintain this Fano tree, have been theoretically analyzed and tested on well-known benchmarks files.
520 $a In the area of pattern recognition, we present the formal theory for optimal pairwise linear classifiers, and a formal analysis of why heuristic functions work. With regard to the theory of optimal pairwise linear classifiers, we derive the necessary and sufficient conditions for the classifier to be optimal and as a pair of straight lines for the two-dimensional case, when the underlying distribution is normal. This, in particular, resolves Minsky's paradox, which has been open since 1957. The corresponding classifiers have been empirically analyzed on synthetic and real-life data showing its superiority over the traditional Fisher's approach. These results have also been extended for the case of multi-dimensional features
520 $a We also present a formal analysis that relates the accuracy of heuristic functions to the optimality of the solutions that heuristic algorithms yield. We prove that given a heuristic algorithm, which could utilize either of two heuristic functions, the more accurate heuristic has a higher probability of yielding a superior solution. This result has also been tested for the database query optimization problem
590 $a School code: 0040
650 $a Computer Science $3 890869
690 $a 098
710 2 $a Carleton University (Canada) $3 1260496
773 0 $t Dissertation Abstracts International $g 63-09B
790 $a 004
790 1 $a Oommen, J., $e adviso
791 $a Ph.D
792 $a 200
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NQ71947