東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A system for automated content organ...

Tian, Ye.

FindBook

Google Book

Amazon

博客來

A system for automated content organization.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	A system for automated content organization./
作者:	Tian, Ye.
面頁冊數:	245 p.
附註:	Adviser: Guo-Qiang Zhang.
Contained By:	Dissertation Abstracts International67-05B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3216885
ISBN:	9780542675799

A system for automated content organization.
Tian, Ye.

A system for automated content organization. - 245 p.

Adviser: Guo-Qiang Zhang.

Thesis (Ph.D.)--Case Western Reserve University, 2006.

The main goal of Information Retrieval (IR) is to facilitate information access from large document collections. Starting from a user's query, usually made in a natural language, a classic IR system retrieves a set of items relevant to the user's query and displays them as a ranked list. Search-engines are examples of IR Systems. They are effective in finding specific items, but search results for less specific information tend to be off-target, overwhelming, and less useful. In this thesis, we report the design, prototyping, and experiences of an experimental system called ACOSys for automated organization of content using menu/folder hierarchies based on a mathematical theory called Formal Concept Analysis (FCA). ACOSys utilizes the concept of FCA and the structure of a hierarchical menu to categorize search results into more specific groups. The resulting items can be found by quickly zeroing in on subfolders where they may reside, saving the effort of browsing through thousands of off-target items. The technical contribution of this thesis consists of the design and implementation of algorithms in three related categories. First, we develop the principle and the coding of a new algorithm for generating concepts and rules. We show by both theoretical and practical study that it is an efficient algorithm for both sparse and dense contexts. Second, we develop an algorithm for maintaining and updating the construction of concept lattices. In comparison to other incremental algorithms, our algorithm not only updates the concept set, but also updates the menu/folder structure; additional items can be added incrementally, and not as an overhaul. Third, instead of using a simple string-match, we provide a semi-automated process for keyword selection, which involves decision-making by a user based on measures such as the word-distribution statistics of a collection. By using the indexing strategy of the Berkeley DB (database system), context sensitive menu hierarchies are constructed in seconds, making ACOSys practical on large number of objects and attributes.

ISBN: 9780542675799Subjects--Topical Terms:

626642
Computer Science.

A system for automated content organization.
LDR:02929nam 2200265 a 45 001 966008
005 20110908
008 110908s2006 eng d
020 $a 9780542675799
035 $a (UnM)AAI3216885
035 $a AAI3216885
040 $a UnM $c UnM
100 1 $a Tian, Ye. $3 1288756
245 1 2 $a A system for automated content organization.
300 $a 245 p.
500 $a Adviser: Guo-Qiang Zhang.
500 $a Source: Dissertation Abstracts International, Volume: 67-05, Section: B, page: 2671.
502 $a Thesis (Ph.D.)--Case Western Reserve University, 2006.
520 $a The main goal of Information Retrieval (IR) is to facilitate information access from large document collections. Starting from a user's query, usually made in a natural language, a classic IR system retrieves a set of items relevant to the user's query and displays them as a ranked list. Search-engines are examples of IR Systems. They are effective in finding specific items, but search results for less specific information tend to be off-target, overwhelming, and less useful. In this thesis, we report the design, prototyping, and experiences of an experimental system called ACOSys for automated organization of content using menu/folder hierarchies based on a mathematical theory called Formal Concept Analysis (FCA). ACOSys utilizes the concept of FCA and the structure of a hierarchical menu to categorize search results into more specific groups. The resulting items can be found by quickly zeroing in on subfolders where they may reside, saving the effort of browsing through thousands of off-target items. The technical contribution of this thesis consists of the design and implementation of algorithms in three related categories. First, we develop the principle and the coding of a new algorithm for generating concepts and rules. We show by both theoretical and practical study that it is an efficient algorithm for both sparse and dense contexts. Second, we develop an algorithm for maintaining and updating the construction of concept lattices. In comparison to other incremental algorithms, our algorithm not only updates the concept set, but also updates the menu/folder structure; additional items can be added incrementally, and not as an overhaul. Third, instead of using a simple string-match, we provide a semi-automated process for keyword selection, which involves decision-making by a user based on measures such as the word-distribution statistics of a collection. By using the indexing strategy of the Berkeley DB (database system), context sensitive menu hierarchies are constructed in seconds, making ACOSys practical on large number of objects and attributes.
590 $a School code: 0042.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Case Western Reserve University. $3 1017714
773 0 $t Dissertation Abstracts International $g 67-05B.
790 $a 0042
790 1 0 $a Zhang, Guo-Qiang, $e advisor
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3216885