2006
DOI: 10.1007/11683568_8
|View full text |Cite
|
Sign up to set email alerts
|

Extracting Named Entities Using Support Vector Machines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
26
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(29 citation statements)
references
References 14 publications
1
26
0
Order By: Relevance
“…As the expert classification is costly and time-consuming task, automatic entity classification traditionally has been part of the NER (Named Entity Recognition) research where the entity is first au-tomatically identified and then classified [11,12,13,14] according to a number of categories. Unfortunately, such automatic algorithms, require predefined concept-based seeds for training and manually defined rules, which complexity depends on the number of involved classes.…”
Section: Entity Annotation and Classificationmentioning
confidence: 99%
“…As the expert classification is costly and time-consuming task, automatic entity classification traditionally has been part of the NER (Named Entity Recognition) research where the entity is first au-tomatically identified and then classified [11,12,13,14] according to a number of categories. Unfortunately, such automatic algorithms, require predefined concept-based seeds for training and manually defined rules, which complexity depends on the number of involved classes.…”
Section: Entity Annotation and Classificationmentioning
confidence: 99%
“…Some of the ML methods that had been used for NER algorithm includes artificial neural network (ANN) [9], Hidden Markov Model (HMM) [14], Maximum Entropy Model (MaxEnt) [15], Decision Tree [16], Support Vector Machine [17] and etc. ML methods are applicable for different domain-specific NER systems but it requires a large collection of annotated data.…”
Section: Types Of Nermentioning
confidence: 99%
“…The author of [3] [5] had shown that Conditional Random Fields (CRFs) are undirected graphical models used to calculate the conditional probability of values on designated output nodes given values assigned to other designated input nodes. A conditional random field (CRF) is a type of discriminative probabilistic model used for the labeling sequential data such as natural language text.…”
Section: Related Workmentioning
confidence: 99%
“…A conditional random field (CRF) is a type of discriminative probabilistic model used for the labeling sequential data such as natural language text. The author of [6] had shown that the maximum entropy [ME] [3], framework estimates probabilities based on the principle of making as few assumptions as possible, other than the constraints imposed. Such constraints are derived from training data, expressing some relationship between features and outcome.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation