Thu, 24 Jul 2008 23:10:32 BST CiteULike: Tag extraction http://www.citeulike.org/tag/extraction CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/ZiqiZhang/article/1222866 <i></i><br /><br />We seek a knowledge-free method for inducing multiword units from text corpora for use as machine-readable dictionary headwords. We provide two major evaluations of nine existing collocation-finders and illustrate the continuing need for improvement. We use Latent Semantic Analysis to make modest gains in performance, but we show the significant challenges encountered in trying this approach. 1 Is Knowledge-Free Induction of Multiword Unit Dictionary Headwords a Solved Problem? Patrick Schone Daniel Jurafsky 2007-04-12T20:28:28-00:00 extraction keyphraseterm http://www.citeulike.org/user/ZiqiZhang/article/1197384 <i>(1999)</i><br /><br />Many academic journals ask their authors to provide a list of about five to fifteen key words, to appear on the first page of each article. Since these key words are often phrases of two or more words, we prefer to call them keyphrases. There is a surprisingly wide variety of tasks for which keyphrases are useful, as we discuss in this paper. Recent commercial software, such as Microsoft's Word 97 and Verity's Search 97, includes algorithms that automatically extract keyphrases from ... Learning to extract keyphrases from text P Turney (1999) 2007-03-30T07:53:48-00:00 1999 extraction keyphrase http://www.citeulike.org/user/ZiqiZhang/article/1223919 <i>(1999), pp. 254-255.</i><br /><br />Keyphrases provide semantic metadata that summarize and characterize documents. This paper describes Kea, an algorithm for automatically extracting keyphrases from text. Kea identifies candidate keyphrases using lexical methods, calculates feature values for each candidate, and uses a machine -learning algorithm to predict which candidates are good keyphrases. The machine learning scheme first builds a prediction model using training documents with known keyphrases, and then uses the model to... KEA: Practical Automatic Keyphrase Extraction Ian Witten Gordon Paynter Eibe Frank Carl Gutwin Craig (1999), pp. 254-255. 2007-04-13T10:16:30-00:00 1999 254 255 extraction keyphrase http://www.citeulike.org/user/yangxian/article/1765997 <i>Data Knowl. Eng., Vol. 59, No. 2. (November 2006), pp. 213-230.</i> Sampling, information extraction and summarisation of hidden web databases Yih-Ling Hedley Muhammad Younas Anne James Mark Sanderson doi:10.1016/j.datak.2006.01.009 Data Knowl. Eng., Vol. 59, No. 2. (November 2006), pp. 213-230. 2007-10-14T01:34:16-00:00 2006 Data Knowl. Eng. 59 2 213 230 Elsevier Science Publishers B. V. extraction http://www.citeulike.org/user/yangxian/article/453818 <i></i><br /><br />Our KNOWITALL system aims to automate the tedious process of extracting large collections of facts (e.g., names of scientists or politicians) from the Web in an autonomous, domain-independent, and scalable manner. Methods for Domain-Independent Information Extraction From Web 2005-12-31T14:49:21-00:00 extraction http://www.citeulike.org/user/Yamo20/article/934291 <i>International Congress Series, Vol. 1261 (April 2004), pp. 553-555.</i><br /><br />DNA identification of many mass fatality victims of the 11 September 2001 attack on the World Trade Centers (WTC) in New York City required development of new analytical methods. Development of novel STR multiplex sets with improved performance using challenged DNA samples is described in an accompanying paper. Here we describe modifications and improvements to procedures used to extract DNA from bone fragments found at the site. Novel method of DNA extraction from bones assisted DNA identification of World Trade Center victims T Bille R Wingrove M Holland C Holland C Cave J Schumm doi:10.1016/S0531-5131(03)01831-4 International Congress Series, Vol. 1261 (April 2004), pp. 553-555. 2006-11-07T12:18:51-00:00 2004 International Congress Series 1261 553 555 bone dna extraction http://www.citeulike.org/user/xiaoyan2006/article/1158486 <i>(2003), pp. 37-48.</i> Automatic document metadata extraction using support vector machines Hui Han Lee Giles Eren Manavoglu Hongyuan Zha Zhenyue Zhang Edward Fox (2003), pp. 37-48. 2007-03-13T19:31:57-00:00 2003 37 48 IEEE Computer Society extraction jcdl07 http://www.citeulike.org/user/xiaoyan2006/article/1158458 <i>(2003), pp. 49-60.</i> Bibliographic attribute extraction from erroneous references based on a statistical model Atsuhiro Takasu (2003), pp. 49-60. 2007-03-13T18:17:41-00:00 2003 49 60 IEEE Computer Society extraction jcdl07 syllabus http://www.citeulike.org/user/wubianwei/article/1444 <i>(2004), pp. 1-8.</i> A two-phase sampling technique for information extraction from hidden web databases YL Hedley M Younas A James M Sanderson doi:10.1145/1031453.1031456 (2004), pp. 1-8. 2004-12-02T14:35:58-00:00 2004 1 8 ACM Press a databases extraction for from hidden information sampling technique two-phase web http://www.citeulike.org/user/wittawat/article/1365557 <i></i><br /><br />This paper discusses the use of our information extraction (IE) system, Textract, in the questionanswering (QA) track of the recently held TREC-8 tests. One of our major objectives is to examine how IE can help IR (Information Retrieval) in applications like QA. Our study shows: (i) IE can provide solid support for QA; (ii) low-level IE like Named Entity tagging is often a necessary component in handling most types of questions; (iii) a robust natural language shallow parser provides a... Information extraction supported question answering R Srihari W Li 2007-06-05T13:01:19-00:00 answering extraction information question http://www.citeulike.org/user/whshen/article/850133 <i></i><br /><br />A region algebra is a collection of operations that apply to lists of regions | a useful model for querying text databases. In this paper, we address the problem of evaluating a region algebra expression. A naive method is to evaluate the operations one at a time, storing intermediate results and reading them back in as needed. We describe an alternative method that merges the argument region lists and performs the evaluation using a single pass over this merged list. This is often more ecient... One-Pass Evaluation of Region Algebra Expressions Matthew Lai Frank 2006-09-19T21:11:55-00:00 algebra extraction region span text http://www.citeulike.org/user/whshen/article/850131 <i></i><br /><br />So called region algebras operating on sets of text fragments have been proposed and implemented as query languages for text documents. Text documents often comprise nested regions like lists within lists or procedures within procedures. Earlier versions of region algebra do not support querying nested regions. We address this deficiency by proposing a new, unrestricted region algebra. The new algebra allows dynamic definition of nested regions. This makes it suitable for querying without any... Nested Text-Region Algebra Jani Jaakkola Pekka Kilpeläinen 2006-09-19T21:10:08-00:00 algebra extraction region text http://www.citeulike.org/user/weinkauf/article/1703478 <i>Active Flow Control (2007), pp. 119-133.</i><br /><br />We present a unified feature extraction architecture consisting of only three core algorithms that allows to extract and track a rich variety of geometrically defined, local and global features evolving in scalar and vector fields. The architecture builds upon the concepts of Feature Flow Fields and Connectors, which can be implemented using the three core algorithms finding zeros, integrating and intersecting stream objects. We apply our methods to extract and track the topology and vortex core lines both in steady and unsteady flow fields. A Unified Feature Extraction Architecture Tino Weinkauf Jan Sahner Holger Theisel Hans-Christian Hege Hans-Peter Seidel doi:10.1007/978-3-540-71439-2_8 Active Flow Control (2007), pp. 119-133. 2007-09-28T01:35:18-00:00 2007 Active Flow Control 119 133 extraction feature flow topology visualization http://www.citeulike.org/user/vmoa/article/816388 <i>Pattern Recognition, Vol. 29, No. 4. (April 1996), pp. 641-662.</i><br /><br />This paper presents an overview of feature extraction methods for off-line recognition of segmented (isolated) characters. Selection of a feature extraction method is probably the single most important factor in achieving high recognition performance in character recognition systems. Different feature extraction methods are designed for different representations of the characters, such as solid binary characters, character contours, skeletons (thinned characters) or gray-level subimages of each individual character. The feature extraction methods are discussed in terms of invariance properties, reconstructability and expected distortions and variability of the characters. The problem of choosing the appropriate feature extraction method for a given application is also discussed. When a few promising feature extraction methods have been identified, they need to be evaluated experimentally to find the best method for the given application. Feature extraction methods for character recognition-A survey Due Anil Jain Torfinn Taxt doi:10.1016/0031-3203(95)00118-2 Pattern Recognition, Vol. 29, No. 4. (April 1996), pp. 641-662. 2006-08-25T07:00:22-00:00 1996 Pattern Recognition 29 4 641 662 extraction feature methods http://www.citeulike.org/user/vmoa/article/820299 <i>Pattern Recognition Letters, Vol. 25, No. 9. (2 July 2004), pp. 975-988.</i><br /><br />The paper presents a novel approach for extracting structural features from segmented cursive handwriting. The proposed approach is based on the contour code and stroke direction. The contour code feature utilises the rate of change of slope along the contour profile in addition to other properties such as the ascender and descender count, start point and end point. The direction feature identifies individual line segments or strokes from the character's outer boundary or thinned representation and highlights each character's pertinent direction information. Each feature is investigated employing a benchmark database and the experimental results using the proposed contour code based structural feature are very promising. A comparative evaluation with the directional feature and existing transition feature is included. A novel approach for structural feature extraction: Contour vs. direction Brijesh Verma Michael Blumenstein Moumita Ghosh doi:10.1016/j.patrec.2004.02.013 Pattern Recognition Letters, Vol. 25, No. 9. (2 July 2004), pp. 975-988. 2006-08-29T01:25:31-00:00 2004 Pattern Recognition Letters 25 9 975 988 contour extraction feature http://www.citeulike.org/user/vlachmore/article/1927460 <i>(2003)</i><br /><br />We present an application of kernel methods to extracting relations from unstructured natural language sources. We introduce kernels defined over shallow parse representations of text, and design efficient algorithms for computing the kernels. We use the devised kernels in conjunction with Support Vector Machine and Voted Perceptron learning algorithms for the task of extracting person-affiliation and organization-location relations from text. We experimentally evaluate the proposed... Kernel methods for relation extraction D Zelenko C Aone A Richardella (2003) 2007-11-16T18:06:02-00:00 2003 extraction kernel methods relation http://www.citeulike.org/user/vlachmore/article/454000 <i>(2004), pp. 581-588.</i> Weakly-supervised relation classification for information extraction Zhu Zhang doi:10.1145/1031171.1031279 (2004), pp. 581-588. 2006-01-02T01:56:12-00:00 2004 581 588 ACM Press bootstrapping extraction relation svm http://www.citeulike.org/user/vlachmore/article/1381474 <i>(2004)</i> Dependency tree kernels for relation extraction Aron Culotta Jeffrey Sorensen doi:10.3115/1218955.1219009 (2004) 2007-06-12T13:31:32-00:00 2004 Association for Computational Linguistics dependency extraction kernels parsing relation tree http://www.citeulike.org/user/vlachmore/article/81954 <i>PLoS Biol, Vol. 2, No. 11. (November 2004)</i><br /><br />We have developed Textpresso, a new text-mining system for scientific literature whose capabilities go far beyond those of a simple keyword search engine. Textpresso's two major elements are a collection of the full text of scientific articles split into individual sentences, and the implementation of categories of terms for which a database of articles and individual sentences can be searched. The categories are classes of biological concepts (e.g., gene, allele, cell or cell group, phenotype, etc.) and classes that relate two objects (e.g., association, regulation, etc.) or describe one (e.g., biological process, etc.). Together they form a catalog of types of objects and concepts called an ontology. After this ontology is populated with terms, the whole corpus of articles and abstracts is marked up to identify terms of these categories. The current ontology comprises 33 categories of terms. A search engine enables the user to search for one or a combination of these tags and/or keywords within a sentence or document, and as the ontology allows word meaning to be queried, it is possible to formulate semantic queries. Full text access increases recall of biological data types from 45% to 95%. Extraction of particular biological facts, such as gene-gene interactions, can be accelerated significantly by ontologies, with Textpresso automatically performing nearly as well as expert curators to identify sentences; in searches for two uniquely named genes and an interaction term, the ontology confers a 3-fold increase of search efficiency. Textpresso currently focuses on Caenorhabditis elegans literature, with 3,800 full text articles and 16,000 abstracts. The lexicon of the ontology contains 14,500 entries, each of which includes all versions of a specific word or phrase, and it includes all categories of the Gene Ontology database. Textpresso is a useful curation tool, as well as search engine for researchers, and can readily be extended to other organism-specific corpora of text. Textpresso can be accessed at http://www.textpresso.org or via WormBase at http://www.wormbase.org. Textpresso: an ontology-based information retrieval and extraction system for biological literature. HM Müller EE Kenny PW Sternberg doi:10.1371/journal.pbio.0020309 PLoS Biol, Vol. 2, No. 11. (November 2004) 2005-01-22T16:50:43-00:00 2004 PLoS Biol 1545-7885 2 11 bionlp extraction gene_ontology information ontology retrieval http://www.citeulike.org/user/vlachmore/article/1102204 <i>Bioinformatics, Vol. 23, No. 3. (1 February 2007), pp. 365-371.</i> RelExRelation extraction using dependency parse trees Katrin Fundel Robert Kuffner Ralf Zimmer doi:10.1093/bioinformatics/btl616 Bioinformatics, Vol. 23, No. 3. (1 February 2007), pp. 365-371. 2007-02-12T07:01:49-00:00 2007 Bioinformatics 1367-4803 23 3 365 371 Oxford University Press bionlp dependency extraction parsing relation http://www.citeulike.org/user/vlachmore/article/177153 <i>Bioinformatics, Vol. 21, No. 9. (1 May 2005), pp. 2049-2058.</i><br /><br />MOTIVATION: The advent of high-throughput experiments in molecular biology creates a need for methods to efficiently extract and use information for large numbers of genes. Recently, the associative concept space (ACS) has been developed for the representation of information extracted from biomedical literature. The ACS is a Euclidean space in which thesaurus concepts are positioned and the distances between concepts indicates their relatedness. The ACS uses co-occurrence of concepts as a source of information. In this paper we evaluate how well the system can retrieve functionally related genes and we compare its performance with a simple gene co-occurrence method. RESULTS: To assess the performance of the ACS we composed a test set of five groups of functionally related genes. With the ACS good scores were obtained for four of the five groups. When compared to the gene co-occurrence method, the ACS is capable of revealing more functional biological relations and can achieve results with less literature available per gene. Hierarchical clustering was performed on the ACS output, as a potential aid to users, and was found to provide useful clusters. Our results suggest that the algorithm can be of value for researchers studying large numbers of genes. AVAILABILITY: The ACS program is available upon request from the authors. CONTACT: r.jelier@erasmusmc.nl. Co-occurrence based meta-analysis of scientific texts: retrieving biological relationships between genes. R Jelier G Jenster LC Dorssers CC van der Eijk EM van Mulligen B Mons JA Kors Bioinformatics, Vol. 21, No. 9. (1 May 2005), pp. 2049-2058. 2005-05-03T09:38:43-00:00 2005 Bioinformatics 1367-4803 21 9 2049 2058 bionlp extraction relation http://www.citeulike.org/user/vlachmore/article/2281284 <i>Artif. Intell. Med., Vol. 39, No. 2. (February 2007), pp. 127-136.</i> Mining of relations between proteins over biomedical scientific literature using a deep-linguistic approach Fabio Rinaldi Gerold Schneider Kaarel Kaljurand Michael Hess Christos Andronis Ourania Konstandi Andreas Persidis doi:10.1016/j.artmed.2006.08.005 Artif. Intell. Med., Vol. 39, No. 2. (February 2007), pp. 127-136. 2008-01-23T17:59:37-00:00 2007 Artif. Intell. Med. 0933-3657 39 2 127 136 Elsevier Science Publishers Ltd. bionlp extraction relation http://www.citeulike.org/user/vlachmore/article/451608 <i>(2000)</i><br /><br />Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use for answering precise queries or for running data mining tasks. We explore a technique for extracting such tables from document collections that requires only a handful of training examples from users. These examples are used to generate extraction patterns, that in turn result in new tuples being extracted from the... Snowball: Extracting Relations from Large Plain-Text Collections Eugene Agichtein Luis Gravano (2000) 2005-12-28T01:32:25-00:00 2000 extraction relation rules seed http://www.citeulike.org/user/vlachmore/article/1185721 <i>Artif. Intell., Vol. 170, No. 14. (October 2006), pp. 1101-1122.</i> Corrective feedback and persistent learning for information extraction Aron Culotta Trausti Kristjansson Andrew Mccallum Paul Viola doi:10.1016/j.artint.2006.08.001 Artif. Intell., Vol. 170, No. 14. (October 2006), pp. 1101-1122. 2007-03-25T01:13:08-00:00 2006 Artif. Intell. 0004-3702 170 14 1101 1122 Elsevier Science Publishers Ltd. conditional extraction feedback fields information random user http://www.citeulike.org/user/vimalthilak/article/2439517 <i>Appl. Opt., Vol. 46, No. 30. (20 October 2007), pp. 7527-7536.</i><br /><br />A passive-polarization-based imaging system records the polarization state of light reflected by objects that are illuminated with an unpolarized and generally uncontrolled source. Such systems can be useful in many remote sensing applications including target detection, object segmentation, and material classification. We present a method to jointly estimate the complex index of refraction and the reflection angle (reflected zenith angle) of a target from multiple measurements collected by a passive polarimeter. An expression for the degree of polarization is derived from the microfacet polarimetric bidirectional reflectance model for the case of scattering in the plane of incidence. Using this expression, we develop a nonlinear least-squares estimation algorithm for extracting an apparent index of refraction and the reflection angle from a set of polarization measurements collected from multiple source positions. Computer simulation results show that the estimation accuracy generally improves with an increasing number of source position measurements. Laboratory results indicate that the proposed method is effective for recovering the reflection angle and that the estimated index of refraction provides a feature vector that is robust to the reflection angle. Polarization-based index of refraction and reflection angle estimation for remote sensing applications Vimal Thilak David Voelz Charles Creusere Appl. Opt., Vol. 46, No. 30. (20 October 2007), pp. 7527-7536. 2008-02-28T03:01:13-00:00 2007 Appl. Opt. 46 30 7527 7536 OSA extraction illumination-invariant image imaging parameters passive pattern polarimetry processing recognition shape http://www.citeulike.org/user/tulaydemir/article/899496 <i>(1997)</i><br /><br />The Internet presents numerous sources of useful information---telephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually formatted for use by people (e.g., the relevant content is embedded in HTML pages), so extracting their content is difficult. Wrappers are often used for this purpose. A wrapper is a procedure for... Wrapper induction for information extraction N Kushmerick D Weld R Doorenbos (1997) 2006-10-16T16:03:00-00:00 1997 extraction ie wrapper http://www.citeulike.org/user/tulaydemir/article/1758402 <i>Knowledge and Data Engineering, IEEE Transactions on, Vol. 18, No. 10. (2006), pp. 1411-1428.</i><br /><br />The Internet presents a huge amount of useful information which is usually formatted for its users, which makes it difficult to extract relevant data from various sources. Therefore, the availability of robust, flexible Information Extraction (IE) systems that transform the Web pages into program-friendly structures such as a relational database will become a great necessity. Although many approaches for data extraction from Web pages have been developed, there has been limited effort to compare such tools. Unfortunately, in only a few cases can the results generated by distinct tools be directly compared since the addressed extraction tasks are different. This paper surveys the major Web data extraction approaches and compares them in three dimensions: the task domain, the automation degree, and the techniques used. The criteria of the first dimension explain why an IE system fails to handle some Web sites of particular structures. The criteria of the second dimension classify IE systems based on the techniques used. The criteria of the third dimension measure the degree of automation for IE systems. We believe these criteria provide qualitatively measures to evaluate various IE approaches. A Survey of Web Information Extraction Systems Chia-Hui Chang M Kayed MR Girgis KF Shaalan Knowledge and Data Engineering, IEEE Transactions on, Vol. 18, No. 10. (2006), pp. 1411-1428. 2007-10-12T02:58:00-00:00 2006 Knowledge and Data Engineering, IEEE Transactions on 18 10 1411 1428 extraction survey web http://www.citeulike.org/user/tulaydemir/article/494100 <i>Decis. Support Syst., Vol. 35, No. 1. (April 2003), pp. 129-147.</i> Automatic information extraction from semi-structured Web pages by pattern discovery Chia-Hui Chang Chun-Nan Hsu Shao-Cheng Lui doi:10.1016/S0167-9236(02)00100-8 Decis. Support Syst., Vol. 35, No. 1. (April 2003), pp. 129-147. 2006-02-06T07:31:53-00:00 2003 Decis. Support Syst. 0167-9236 35 1 129 147 Elsevier Science Publishers B. V. 2003 automatic extraction iepad pattern semi-structured http://www.citeulike.org/user/tulaydemir/article/530795 <i>(2002), pp. 264-277.</i> Automatic Web Information Extraction in the ROADRUNNER System Valter Crescenzi Giansalvatore Mecca Paolo Merialdo (2002), pp. 264-277. 2006-03-04T06:08:15-00:00 2002 264 277 Springer-Verlag automatic extraction html roadrunner system http://www.citeulike.org/user/tulaydemir/article/520460 <i>(2004)</i><br /><br />The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant information within this huge repository of data. Although several techniques have been developed to the problem of Web data extraction, their use is still not spread, mostly because of the need for high human intervention and the low quality of the extraction results. In this paper, we present a domain-oriented approach to... Automatic web news extraction using tree edit distance D Reis P Golgher A Silva A Laender (2004) 2006-02-25T06:20:37-00:00 2004 extraction news tree http://www.citeulike.org/user/tulaydemir/article/876099 <i>(2001)</i><br /><br />In this paper we present a method for automatically segmenting unformatted text records into structured elements. Several useful data sources today are human-generated as continuous text whereas convenient usage requires the data to be organized as structured records. A prime motivation is the warehouse address cleaning problem of transforming dirty addresses stored in large corporate databases as a single text field into subfields like "City" and "Street". Existing tools rely on hand-tuned,... Automatic Segmentation of Text into Structured Records Vinayak Borkar Kaustubh Deshmukh Sunita Sarawagi (2001) 2006-09-28T08:53:55-00:00 2001 extraction hmm http://www.citeulike.org/user/tulaydemir/article/1766116 <i>Int. J. Hum.-Comput. Stud., Vol. 65, No. 9. (September 2007), pp. 816-831.</i> A redundancy-based method for the extraction of relation instances from the Web Viktor de Boer Maarten van Someren Bob Wielinga doi:10.1016/j.ijhcs.2007.05.002 Int. J. Hum.-Comput. Stud., Vol. 65, No. 9. (September 2007), pp. 816-831. 2007-10-14T03:11:55-00:00 2007 Int. J. Hum.-Comput. Stud. 1071-5819 65 9 816 831 Academic Press, Inc. extraction ontology http://www.citeulike.org/user/tulaydemir/article/1766076 <i>Data Knowl. Eng., Vol. 54, No. 1. (July 2005), pp. 3-28.</i><br /><br />Data on the Web in HTML tables is mostly structured, but we usually do not know the structure in advance. Thus, we cannot directly query for data of interest. We propose a solution to this problem based on document-independent extraction ontologies. Our solution entails elements of table understanding, data integration, and wrapper creation. Table understanding allows us to find tables of interest within a Web page, recognize attributes and values within the table, pair attributes with values, and form records. Data-integration techniques allow us to match source records with a target schema. Ontologically specified wrappers allow us to extract data from source records into a target schema. Experimental results show that we can successfully locate data of interest in tables and map the data from source HTML tables with unknown structure to a given target database schema. We can thus “directly” query source data with unknown structure through a known target schema. Automating the extraction of data from HTML tables with unknown structure David Embley Cui Tao Stephen Liddle doi:10.1016/j.datak.2004.10.004 Data Knowl. Eng., Vol. 54, No. 1. (July 2005), pp. 3-28. 2007-10-14T02:40:17-00:00 2005 Data Knowl. Eng. 54 1 3 28 Elsevier Science Publishers B. V. 2005 automatic extraction ontology http://www.citeulike.org/user/tomisc/article/2919798 <i>Bioresource Technology, Vol. 96, No. 1. (January 2005), pp. 121-123.</i><br /><br />Use of ultrasonication as a pretreatment before aqueous oil extraction and aqueous enzymatic oil extraction was found to be useful in the case of extraction of oil from the seeds of Jatropha curcas L. The use of ultrasonication for 10 min at pH 9.0 followed by aqueous oil extraction gave a yield of 67%. However, the maximum yield of 74% was obtained by ultrasonication for 5 min followed by aqueous enzymatic oil extraction using an alkaline protease at pH 9.0. Use of ultrasonication also resulted in reducing the process time from 18 to 6 h. Extraction of oil from Jatropha curcas L. seed kernels by combination of ultrasonication and aqueous enzymatic oil extraction Shweta Shah Aparna Sharma MN Gupta doi:10.1016/j.biortech.2004.02.026 Bioresource Technology, Vol. 96, No. 1. (January 2005), pp. 121-123. 2008-06-23T21:20:29-00:00 2005 Bioresource Technology 96 1 121 123 extraction jatropha oil http://www.citeulike.org/user/tkosaka/article/1586540 <i>Comparative Political Studies, Vol. 39, No. 8. (1 October 2006), pp. 943-968.</i><br /><br />This article proposes a political economy of extraction framework that explains political order and state collapse as alternative outcomes in the face of lootable wealth. Different types of institutions of extraction can be built on lootable resources--with divergent effects on political stability. If rulers are able to forge institutions of extraction that give them control of revenues generated by lootable resources, then these resources can contribute to political order by providing the income with which to govern. Conversely, the breakdown or absence of such institutions increases the risk of civil war by making it easier for rebels to organize. The framework is used to explain two puzzling cases that experienced sharply contrasting political trajectories in the face of lootable resources: Sierra Leone and Burma. A focus on institutions of extraction provides a stronger understanding of the wide range of political outcomes--from chaos, to dictatorship, to democracy--in resource-rich countries. 10.1177/0010414006288724 Does Lootable Wealth Breed Disorder?: A Political Economy of Extraction Framework Richard Snyder doi:10.1177/0010414006288724 Comparative Political Studies, Vol. 39, No. 8. (1 October 2006), pp. 943-968. 2007-08-23T18:25:19-00:00 2006 Comparative Political Studies 39 8 943 968 burma civil_war extraction institution lootable_wealth natural_resources order political_economy sierra_leone _zzz_cp_keio20080628 http://www.citeulike.org/user/tejasgn/article/1105321 <i>(1998), pp. 934-943.</i> Augmented Reality Visualization for Laparoscopic Surgery Henry Fuchs Mark Livingston Ramesh Raskar D`nardo Colucci Kurtis Keller Andrei State Jessica Crawford Paul Rademacher Samuel Drake Anthony Meyer (1998), pp. 934-943. 2007-02-13T17:05:41-00:00 1998 934 943 Springer-Verlag depth extraction laproscope stereo http://www.citeulike.org/user/sparfait/article/1104631 <i>Stat Med, Vol. 22, No. 1. (15 January 2003), pp. 147-164.</i><br /><br />Magnetic resonance spectroscopy (MRS) provides a non-invasive measurement of the biochemistry of living tissue. However, signal variation due to tissue heterogeneity causes considerable mixing between different disease categories, making accurate class assignments difficult. This paper compares a systematic methodology for classifier design using multivariate bayesian variable selection (MBVS), with one based on feature extraction using independent component analysis (ICA). We illustrate the methodology and assess the classification performance using a data set comprising 41 magnetic resonance spectra acquired in vivo from two grades of brain tumour, namely low- and medium-grade astrocytic tumours, labelled astrocytomas (AST), and high-grade gliomas and glioblastomas labelled glioblastomas (GL). The aim of this study is threefold. First, to describe the application of the alternative methodologies to MRS, then to benchmark their classification performance, and finally to interpret the classification models in terms of biologically relevant signals derived from the spectra. The classification performance is assessed using the bootstrap method and by application to a test sample in a retrospective study. Tumour grading from magnetic resonance spectroscopy: a comparison of feature extraction with variable selection. Y Huang PJ Lisboa W El-Deredy doi:10.1002/sim.1321 Stat Med, Vol. 22, No. 1. (15 January 2003), pp. 147-164. 2007-02-13T08:23:56-00:00 2003 Stat Med 0277-6715 22 1 147 164 extraction feature mrs http://www.citeulike.org/user/seungwon/article/791436 <i>Commun. ACM, Vol. 49, No. 5. (May 2006), pp. 78-84.</i> Adaptive web information extraction Dawn Gregg Steven Walczak doi:10.1145/1125944.1125945 Commun. ACM, Vol. 49, No. 5. (May 2006), pp. 78-84. 2006-08-09T19:53:46-00:00 2006 Commun. ACM 0001-0782 49 5 78 84 ACM Press extraction information retrieval web http://www.citeulike.org/user/selvasukumar/article/1632698 <i>Cold Spring Harbor Protocols, Vol. 2006, No. 1. (1 May 2006), pdb.prot4455.</i><br /><br />10.1101/pdb.prot4455 Purification of Nucleic Acids by Extraction with Phenol:Chloroform Joseph Sambrook David Russell doi:10.1101/pdb.prot4455 Cold Spring Harbor Protocols, Vol. 2006, No. 1. (1 May 2006), pdb.prot4455. 2007-09-07T22:49:34-00:00 2006 Cold Spring Harbor Protocols 2006 1 pdb.prot4455 chloroform extraction phenol http://www.citeulike.org/user/seb314/article/843472 <i>ACM Transactions on Graphics, Vol. 22, No. 3. (July 2003), pp. 954-961.</i><br /><br />Cutting up a complex object into simpler sub-objects is a fundamental problem in various disciplines. In image processing, images are segmented while in computational geometry, solid polyhedra are decomposed. In recent years, in computer graphics, polygonal meshes are decomposed into sub-meshes. In this paper we propose a novel hierarchical mesh decomposition algorithm. Our algorithm computes a decomposition into the meaningful components of a given mesh, which generally refers to segmentation at regions of deep concavities. The algorithm also avoids over-segmentation and jaggy boundaries between the components. Finally, we demonstrate the utility of the algorithm in control-skeleton extraction. Hierarchical mesh decomposition using fuzzy clustering and cuts Sagi Katz Ayellet Tal doi:10.1145/882262.882369 ACM Transactions on Graphics, Vol. 22, No. 3. (July 2003), pp. 954-961. 2006-09-14T13:57:06-00:00 2003 ACM Transactions on Graphics 22 3 954 961 ACM Press control-skeleton decomposition extraction mesh segmentation http://www.citeulike.org/user/seabay/article/348285 <i>J. ACM, Vol. 51, No. 1. (January 2004), pp. 74-113.</i> Monadic datalog and the expressive power of languages for Web information extraction Georg Gottlob Christoph Koch doi:10.1145/962446.962450 J. ACM, Vol. 51, No. 1. (January 2004), pp. 74-113. 2005-10-11T19:34:21-00:00 2004 J. ACM 0004-5411 51 1 74 113 ACM Press datalog extraction mso http://www.citeulike.org/user/Scis0000002/article/940795 <i>(1 Dec 1998)</i><br /><br />We discuss some physical consequences of what might be called “the ultimate ensemble theory”, where not only worlds corresponding to say different sets of initial data or different physical constants are considered equally real, but also worlds ruled by altogether different equations. The only postulate in this theory is that all structures that exist mathematically exist also physically, by which we mean that in those complex enough to contain self-aware substructures (SASs), these SASs will subjectively perceive themselves as existing in a physically “real” world. We find that it is far from clear that this simple theory, which has no free parameters whatsoever, is observationally ruled out. The predictions of the theory take the form of probability distributions for the outcome of experiments, which makes it testable. In addition, it may be possible to rule it out by comparing its a priori predictions for the observable attributes of nature (the particle masses, the dimensionality of spacetime, etc) with what is observed. Is “the theory of everything” merely the ultimate ensemble theory? Max Tegmark (1 Dec 1998) 2006-11-12T17:22:35-00:00 1998 accessibility all-categorical-structures all-mathematical-structures all-possible-worlds complexity computability computability-theory constructivization control controlability decision-procedure exploitation exploiting exploration exploring extendability extraction formal-interoperability formalization-hypothesis formal-problem-solving formal-science formal-theories goedel-machine hierarchy-of-machines higher-dimensional-category-theory hypercomputability hypercomputing hyperefficiency intelligence-order-relations interconnectivity interoperability mathematical-structures metaevolution metalogical-frameworks metalogics metamathematical-frameworks metamathematics metaphilosophy metascience metaselection philosophy-of-science physical-structures power presentation quantum-computability regularities representation resource-allocation selection specification survivability topos-theory transformation http://www.citeulike.org/user/Scis0000002/article/126700 <i>(2003), pp. 519-528.</i> Mining the peanut gallery: opinion extraction and semantic classification of product reviews Kushal Dave Steve Lawrence David Pennock doi:10.1145/775152.775226 (2003), pp. 519-528. 2005-03-14T16:47:56-00:00 2003 519 528 ACM Press extraction opinions http://www.citeulike.org/user/Scis0000002/article/1376317 <i>(2005), pp. 133-140.</i> Automatic semantics extraction in law documents C Biagioli E Francesconi A Passerini S Montemagni C Soria doi:10.1145/1165485.1165506 (2005), pp. 133-140. 2007-06-10T15:55:29-00:00 2005 133 140 ACM Press extraction laws rules semantics http://www.citeulike.org/user/Scis0000002/article/1577672 <i>(2004)</i><br /><br />We present a novel approach to the automatic acquisition of taxonomic relations. The main difference to earlier approaches is that we do not only consider one single source of evidence, i.e. a specific algorithm or approach, but examine the possibility of learning taxonomic relations by considering various and heterogeneous forms of evidence. In particular, we derive these different evidences by using well-known NLP techniques and resources and combine them via two simple strategies. Our... Learning taxonomic relations from heterogeneous sources P Cimiano A Pivk Schmidt Thieme S Staab (2004) 2007-08-20T23:35:01-00:00 2004 extraction relations taxonomic taxonomy http://www.citeulike.org/user/scis0000001/article/832747 <i>(1995), pp. 90-97.</i><br /><br />We present a framework for accurate and robust extraction of parametric models of different types. It includes a mechanism that lets each model type determine its domain of applicability. The framework is general in the sense that it can be described and implemented without specifying the following components: a domain of application, a particular type of data, a set of admissible model types, and a specific fitting technique. It is a conceptually clean approach to model extraction, and... ExSel++: A General Framework to Extract Parametric Models Markus Stricker Ales Leonardis (1995), pp. 90-97. 2006-09-06T18:08:43-00:00 1995 90 97 extraction modeling parametric-model reconstruction http://www.citeulike.org/user/scis0000001/article/998719 <i>(2001)</i><br /><br />. The ability to rapidly locate useful on-line services (e.g. software applications, software components, process models, or service organizations), as opposed to simply useful documents, is becoming increasingly critical in many domains. As the sheer number of such services increases it will become increasingly more important to provide tools that allow people (and software) to quickly find the services they need, while minimizing the burden for those who wish to list their services with ... Searching for Services on the Semantic Web using Process Ontologies M Klein A Bernstein (2001) 2006-12-17T16:57:04-00:00 2001 extraction functionality searching http://www.citeulike.org/user/scis0000001/article/933535 <i></i><br /><br />Named entity recognition and classification research has so far mainly focused on supervised techniques and has typically considered only small sets of classes with regard to which to classify the recognized entities. Towards Large-Scale, Open-Domain and Ontology-Based Named Entity Classification Philipp Cimiano Johanna Völker 2006-11-06T15:12:31-00:00 extraction named-entity http://www.citeulike.org/user/scis0000001/article/1117482 <i>Lecture Notes in Computer Science, Vol. 2116 (2001), pp. 30-??.</i><br /><br />In order to be useful, intelligent information retrieval agents must provide their users with context-relevant information. This paper presents WordSieve, an algorithm for automatically extracting information about the context in which documents are consulted during web browsing. Using information extracted from the stream of documents consulted by the user, WordSieve automatically builds context profiles which differentiate sets of documents that users tend to access in groups. These... WordSieve: A Method for Real-Time Context Extraction Travis Bauer David Leake Lecture Notes in Computer Science, Vol. 2116 (2001), pp. 30-??. 2007-02-22T09:44:46-00:00 2001 Lecture Notes in Computer Science 2116 30 ?? context extraction real-time http://www.citeulike.org/user/scis0000001/article/988006 <i>(2003)</i><br /><br />We present an application of kernel methods to extracting relations from unstructured natural language sources. Kernel methods for relation extraction D Zelenko C Aone A Richardella (2003) 2006-12-10T14:40:47-00:00 2003 extraction kernel relations