Information Extraction for Call for Paper

2020 ◽  
pp. 394-409
Author(s):  
Laurent Issertial ◽  
Hiroshi Tsuji
Keyword(s):  
Text Mining ◽  
Information Extraction ◽  
False Positive ◽  
Relevant Information ◽  
End User ◽  
Rule Based ◽  
Complex Queries ◽  
Mining Algorithm ◽  
Text Searching ◽  
Searching Method

This paper proposes a system called CFP Manager specialized on IT field and designed to ease the process of searching conference suitable to one's need. At present, the handling of CFP faces two problems: for emails, the huge quantity of CFP received can be easily skimmed through. For websites, the reviewing of some of the main CFP aggregators available online points out the lack of usable criteria. This system proposes to answer to these problems via its architecture consisting of three components: firstly an Information Extraction module extracting relevant information (as date, location, etc...) from CFP using rule based text mining algorithm. The second component enriches the now extracted data with external one from ontology models. Finally the last one displays the said data and allows the end user to perform complex queries on the CFP dataset and thus allow him to only access to CFP suitable for him. In order to validate the authors' proposal, they eventually process the well-known precision / recall metric on our information extraction component with an average of 0.95 for precision and 0.91 for recall on three different 100 CFP dataset. This paper finally discusses the validity of our approach by confronting our system for different queries with two systems already available online (WikiCFP and IEEE Conference Search) and basic text searching approach standing for searching in an email box. On a 100 CFP dataset with the wide variety of usable data and the possibility to perform complex queries we surpass basic text searching method and WikiCFP by not returning the false positive usually returned by them and find a result close to the IEEE system.

Information Extraction for Call for Paper

2015 ◽  
Vol 6 (4) ◽  
pp. 35-49 ◽  
Author(s):  
Laurent Issertial ◽  
Hiroshi Tsuji
Keyword(s):  
Text Mining ◽  
Information Extraction ◽  
False Positive ◽  
Relevant Information ◽  
End User ◽  
Rule Based ◽  
Complex Queries ◽  
Mining Algorithm ◽  
Text Searching ◽  
Searching Method

This paper proposes a system called CFP Manager specialized on IT field and designed to ease the process of searching conference suitable to one's need. At present, the handling of CFP faces two problems: for emails, the huge quantity of CFP received can be easily skimmed through. For websites, the reviewing of some of the main CFP aggregators available online points out the lack of usable criteria. This system proposes to answer to these problems via its architecture consisting of three components: firstly an Information Extraction module extracting relevant information (as date, location, etc...) from CFP using rule based text mining algorithm. The second component enriches the now extracted data with external one from ontology models. Finally the last one displays the said data and allows the end user to perform complex queries on the CFP dataset and thus allow him to only access to CFP suitable for him. In order to validate the authors' proposal, they eventually process the well-known precision / recall metric on our information extraction component with an average of 0.95 for precision and 0.91 for recall on three different 100 CFP dataset. This paper finally discusses the validity of our approach by confronting our system for different queries with two systems already available online (WikiCFP and IEEE Conference Search) and basic text searching approach standing for searching in an email box. On a 100 CFP dataset with the wide variety of usable data and the possibility to perform complex queries we surpass basic text searching method and WikiCFP by not returning the false positive usually returned by them and find a result close to the IEEE system.

Information Extraction of Protein Phosphorylation from Biomedical Literature

2010 ◽  
pp. 163-176
Author(s):  
M. Narayanaswamy ◽  
K. E. Ravikumar ◽  
Z. Z. Hu ◽  
K. Vijay-Shanker ◽  
C. H. Wu
Keyword(s):  
Text Mining ◽  
Information Extraction ◽  
Protein Phosphorylation ◽  
Biomedical Literature ◽  
Literature Mining ◽  
Second Phase ◽  
Mining System ◽  
Rule Based ◽  
Kinase Substrate ◽  
Fundamental Biological Process

Protein posttranslational modification (PTM) is a fundamental biological process, and currently few text mining systems focus on PTM information extraction. A rule-based text mining system, RLIMS-P (Rule-based LIterature Mining System for Protein Phosphorylation), was recently developed by our group to extract protein substrate, kinase and phosphorylated residue/sites from MEDLINE abstracts. This chapter covers the evaluation and benchmarking of RLIMS-P and highlights some novel and unique features of the system. The extraction patterns of RLIMS-P capture a range of lexical, syntactic and semantic constraints found in sentences expressing phosphorylation information. RLIMS-P also has a second phase that puts together information extracted from different sentences. This is an important feature since it is not common to find the kinase, substrate and site of phosphorylation to be mentioned in the same sentence. Small modifications to the rules for extraction of phosphorylation information have also allowed us to develop systems for extraction of two other PTMs, acetylation and methylation. A thorough evaluation of these two systems needs to be completed. Finally, an online version of RLIMSP with enhanced functionalities, namely, phosphorylation annotation ranking, evidence tagging, and protein entity mapping, has been developed and is publicly accessible.

Semi-automatic rule-based domain terminology and software feature-relevant information extraction from natural language user manuals

2018 ◽  
Vol 23 (6) ◽  
pp. 3630-3683 ◽  
Author(s):  
Thomas Quirchmayr ◽  
Barbara Paech ◽  
Roland Kohl ◽  
Hannes Karey ◽  
Gunar Kasdepke
Keyword(s):  
Natural Language ◽  
Information Extraction ◽  
Relevant Information ◽  
Rule Based ◽  
Language User

Haunted by a Doppelgänger

2014 ◽  
Vol 61 (1) ◽  
pp. 12-22 ◽  
Author(s):  
Bettina von Helversen ◽  
Stefan M. Herzog ◽  
Jörg Rieskamp
Keyword(s):  
Relevant Information ◽  
Psychological Research ◽  
Decision Makers ◽  
Human Judgment ◽  
Rule Based ◽  
New Employees ◽  
High Performing ◽  
Facial Similarity ◽  
Similarity Effect ◽  
Judgment Strategy

Judging other people is a common and important task. Every day professionals make decisions that affect the lives of other people when they diagnose medical conditions, grant parole, or hire new employees. To prevent discrimination, professional standards require that decision makers render accurate and unbiased judgments solely based on relevant information. Facial similarity to previously encountered persons can be a potential source of bias. Psychological research suggests that people only rely on similarity-based judgment strategies if the provided information does not allow them to make accurate rule-based judgments. Our study shows, however, that facial similarity to previously encountered persons influences judgment even in situations in which relevant information is available for making accurate rule-based judgments and where similarity is irrelevant for the task and relying on similarity is detrimental. In two experiments in an employment context we show that applicants who looked similar to high-performing former employees were judged as more suitable than applicants who looked similar to low-performing former employees. This similarity effect was found despite the fact that the participants used the relevant résumé information about the applicants by following a rule-based judgment strategy. These findings suggest that similarity-based and rule-based processes simultaneously underlie human judgment.

scholarly journals TREASURE: Text Mining Algorithm Based On Affinity Analysis and Set Intersection to Find the Action of Tuberculosis Drugs against Other Pathogens

2021 ◽  
Vol 11 (15) ◽  
pp. 6834
Author(s):  
Pradeepa Sampath ◽  
Nithya Shree Sridhar ◽  
Vimal Shanmuganathan ◽  
Yangsun Lee
Keyword(s):  
Text Mining ◽  
Causes Of Death ◽  
Intersection Property ◽  
Research Papers ◽  
Bacterial Diseases ◽  
Mining Algorithm ◽  
Set Intersection ◽  
The World ◽  
Medical Researchers

Tuberculosis (TB) is one of the top causes of death in the world. Though TB is known as the world’s most infectious killer, it can be treated with a combination of TB drugs. Some of these drugs can be active against other infective agents, in addition to TB. We propose a framework called TREASURE (Text mining algoRithm basEd on Affinity analysis and Set intersection to find the action of tUberculosis dRugs against other pathogEns), which particularly focuses on the extraction of various drug–pathogen relationships in eight different TB drugs, namely pyrazinamide, moxifloxacin, ethambutol, isoniazid, rifampicin, linezolid, streptomycin and amikacin. More than 1500 research papers from PubMed are collected for each drug. The data collected for this purpose are first preprocessed, and various relation records are generated for each drug using affinity analysis. These records are then filtered based on the maximum co-occurrence value and set intersection property to obtain the required inferences. The inferences produced by this framework can help the medical researchers in finding cures for other bacterial diseases. Additionally, the analysis presented in this model can be utilized by the medical experts in their disease and drug experiments.

Sign in / Sign up

Export Citation Format

Share Document