Event coreference resolution using particle swarm optimisation Online publication date: Sat, 30-Aug-2014
by S. Sangeetha; Michael Arock
International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP), Vol. 4, No. 3, 2014
Abstract: Due to the tremendous increase of documents in the web, people who need information are not ready to spend much time in reading the entire content of documents retrieved. Instead they need precise information. A kind of precise information obtained in our work is event corefering sentences. All sentences referring to the same event instance are called event corefering sentences. Our proposed approach formulates this event coreference resolution as a graph-based clustering model. It constructs the graph based on the sentences in the document with edge weights representing similarity score between each pair of sentences. To reduce the number of singleton clusters and to have a balanced cut, our approach combines minimum conductance with cut clustering to form clusters of corefering sentences. As finding minimum conductance is NP-hard, it uses particle swarm optimisation technique to obtain minimum conductance.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook