東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Information Extraction and Metadata ...

Tuarob, Suppawong.

FindBook

Google Book

Amazon

博客來

Information Extraction and Metadata Annotation for Algorithms in Digital Libraries.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Information Extraction and Metadata Annotation for Algorithms in Digital Libraries./
作者:	Tuarob, Suppawong.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2015,
面頁冊數:	123 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
Contained By:	Dissertation Abstracts International78-10B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10609615
ISBN:	9781369828306

Information Extraction and Metadata Annotation for Algorithms in Digital Libraries.
Tuarob, Suppawong.

Information Extraction and Metadata Annotation for Algorithms in Digital Libraries. - Ann Arbor : ProQuest Dissertations & Theses, 2015 - 123 p.

Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.

Thesis (Ph.D.)--The Pennsylvania State University, 2015.

Algorithms are developed in computer science and related disciplines to provide concise step-by-step instructions for solving particular problems. For example, Dijkstra's algorithm was developed by computer scientist Edsger Dijkstra in 1956 to find a shortest path in a graph with a single source node. As science advances, problems in other disciplines are often transformed into algorithmic ones so that standard algorithms can be applied. For example, algorithms for stock portfolio optimization are used for diversifying search results in information retrieval systems.

ISBN: 9781369828306Subjects--Topical Terms:

523869
Computer science.

Information Extraction and Metadata Annotation for Algorithms in Digital Libraries.
LDR:03742nmm a2200337 4500 001 2124396
005 20171030105231.5
008 180830s2015 ||||||||||||||||| ||eng d
020 $a 9781369828306
035 $a (MiAaPQ)AAI10609615
035 $a AAI10609615
040 $a MiAaPQ $c MiAaPQ
100 1 $a Tuarob, Suppawong. $3 3286396
245 1 0 $a Information Extraction and Metadata Annotation for Algorithms in Digital Libraries.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2015
300 $a 123 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
500 $a Advisers: C. Lee Giles; Prasenjit Mitra.
502 $a Thesis (Ph.D.)--The Pennsylvania State University, 2015.
520 $a Algorithms are developed in computer science and related disciplines to provide concise step-by-step instructions for solving particular problems. For example, Dijkstra's algorithm was developed by computer scientist Edsger Dijkstra in 1956 to find a shortest path in a graph with a single source node. As science advances, problems in other disciplines are often transformed into algorithmic ones so that standard algorithms can be applied. For example, algorithms for stock portfolio optimization are used for diversifying search results in information retrieval systems.
520 $a Though algorithm collections such as encyclopedias (e.g. Wikipedia) and algorithm textbooks manually catalog algorithms and make them available, such collections only contain standard algorithms (algorithms which are well defined and well known). Examples of standard algorithms include Dijkstra's algorithm, Binary search, Fast Fourier transform, etc. Despite the well-established nature of these standard algorithms, they hardly satisfy the needs of algorithm users and researchers who seek cutting-edge solutions to their problems. Fortunately, researchers constantly develop new algorithms to solve new problems that have not been solved before, or new algorithms that improve upon the existing ones. A significant number of scholarly articles in computer science and related disciplines hence contain high-quality algorithms developed by researchers. However, manually searching for algorithms in a pile of papers would be tedious. Therefore, it would be useful to have a system that automatically collects and enables the search for this ever-increasing collection of algorithms.
520 $a Despite the development of various search engine systems for entities in scholarly documents such as tables, figures, mathematical expressions, etc., systems that collect and index algorithms from scholarly documents never existed. The difficulty of automatically identifying algorithm representations and extracting their metadata make this problem challenging. While the needs for algorithm search engines are apparent, literature on the possibility to build such systems is still in the infant stage.
520 $a This dissertation discusses AlgorithmSeer, a search engine for algorithms. AlgorithmSeer collects algorithms from scholarly documents in the forms of pseudo-codes and algorithmic procedures. It then extracts and indexes the algorithm metadata, allowing algorithms to be searched. We raise the issue of metadata annotation, which can be solved by transferring the annotation from the well- annotated corpus via topical modeling. Finally, we discuss the potential use of algorithm citations in order to enhance the search capacity beyond traditional text based search.
590 $a School code: 0176.
650 4 $a Computer science. $3 523869
650 4 $a Artificial intelligence. $3 516317
650 4 $a Library science. $3 539284
690 $a 0984
690 $a 0800
690 $a 0399
710 2 $a The Pennsylvania State University. $b Computer Science and Engineering. $3 2095963
773 0 $t Dissertation Abstracts International $g 78-10B(E).
790 $a 0176
791 $a Ph.D.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10609615