90 search results - page 6 / 18 » Maximum Entropy Markov Models for Information Extraction and... |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
We consider the problem of improving named entity recognition (NER) systems by using external dictionaries--more specifically, the problem of extending state-of-the-art NER system...
ASIAMS
2007
IEEE
14 years 1 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
CIKM
2009
Springer
14 years 5 days ago
2009
Springer
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
We demonstrate the usefulness of the uniform resource locator (URL) alone in performing web page classification. This approach is magnitudes faster than typical web page classific...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...