[PDF][PDF] Joint entity and event coreference resolution across documents

H Lee, M Recasens, A Chang… - Proceedings of the …, 2012 - aclanthology.org
We introduce a novel coreference resolution system that models entities and events jointly.
Our iterative method cautiously constructs clusters of entity and event mentions using linear …

A new scalable parallel DBSCAN algorithm using the disjoint-set data structure

MMA Patwary, D Palsetia, A Agrawal… - SC'12: Proceedings …, 2012 - ieeexplore.ieee.org
DBSCAN is a well-known density based clustering algorithm capable of discovering
arbitrary shaped clusters and eliminating noise data. However, parallelization of DBSCAN is …

Global nanotechnology development from 1991 to 2012: patents, scientific publications, and effect of NSF funding

H Chen, MC Roco, J Son, S Jiang, CA Larson… - Journal of nanoparticle …, 2013 - Springer
In a relatively short interval for an emerging technology, nanotechnology has made a
significant economic impact in numerous sectors including semiconductor manufacturing …

Data from telecommunication networks for incident management: An exploratory review on transport safety and security

J Steenbruggen, MT Borzacchiello, P Nijkamp… - Transport Policy, 2013 - Elsevier
Problems such as traffic congestion and environmental sustainability are forcing us to review
our long-term plans for transport, whose aim should be to develop and improve safety …

Scalable parallel OPTICS data clustering using graph algorithmic techniques

MA Patwary, D Palsetia, A Agrawal, W Liao… - Proceedings of the …, 2013 - dl.acm.org
OPTICS is a hierarchical density-based data clustering algorithm that discovers arbitrary-
shaped clusters and eliminates noise using adjustable reachability distance thresholds …

Pardicle: Parallel approximate density-based clustering

MMA Patwary, N Satish, N Sundaram… - SC'14: Proceedings …, 2014 - ieeexplore.ieee.org
DBSCAN is a widely used is density-based clustering algorithm for particle data well-known
for its ability to isolate arbitrarily-shaped clusters and to filter noise data. The algorithm is …

Anomaly detection in a mobile communication network

A Pawling, NV Chawla, G Madey - Computational and Mathematical …, 2007 - Springer
Mobile communication networks produce massive amounts of data which may be useful in
identifying the location of an emergency situation and the area it affects. We propose a one …

Incremental clustering of news reports

J Azzopardi, C Staff - Algorithms, 2012 - mdpi.com
When an event occurs in the real world, numerous news reports describing this event start to
appear on different news sites within a few minutes of the event occurrence. This may result …

Parallel data reduction techniques for big datasets

AA Yıldırım, C Özdoğan, D Watson - Big data management …, 2014 - igi-global.com
Data reduction is perhaps the most critical component in retrieving information from big data
(ie, petascale-sized data) in many data-mining processes. The central issue of these data …

MOSAIC: A proximity graph approach for agglomerative clustering

J Choo, R Jiamthapthaksin, C Chen… - Data Warehousing and …, 2007 - Springer
Representative-based clustering algorithms are quite popular due to their relative high
speed and because of their sound theoretical foundation. On the other hand, the clusters …