Author image not provided
 Neil J Hurley

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article9.39
Citation Count526
Publication count56
Publication years1991-2017
Available for download26
Average downloads per article533.08
Downloads (cumulative)13,860
Downloads (12 Months)1,307
Downloads (6 Weeks)162
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


62 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 62
Result page: 1 2 3 4

Sort by:

1 published by ACM
August 2018 ICPP 2018: Proceedings of the 47th International Conference on Parallel Processing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 20,   Downloads (Overall): 20

Full text available: PDFPDF
We consider the loop less k-shortest path (KSP) problem. Although this problem has been studied in the sequential setting for at least the last two decades, no good parallel implementations are known. In this paper, we provide (i) a first systematic empirical comparison of various KSP algorithms and heuristic optimisations, ...
Keywords: Algorithm Engineering, Parallel Graph Algorithms, Parallel Single Source Shortest Path, Parallel k-Shortest Path

2 published by ACM
July 2018 UMAP '18: Proceedings of the 26th Conference on User Modeling, Adaptation and Personalization
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 52,   Downloads (Overall): 52

Full text available: PDFPDF
Diversity has been identified as one of the key dimensions of recommendation utility that should be considered besides the overall accuracy of the system. A common diversification approach is to rerank results produced by a baseline recommendation engine according to a diversification criterion. The intent-aware framework is one of the ...
Keywords: intent-aware diversification, item-based collaborative filtering, recommender systems

3 published by ACM
July 2018 UMAP '18: Proceedings of the 26th Conference on User Modeling, Adaptation and Personalization
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 8,   Downloads (12 Months): 37,   Downloads (Overall): 37

Full text available: PDFPDF
Many state-of-the-art recommender systems are known to suffer from popularity bias, which means that they have a tendency to recommend items that are already popular, making those items even more popular. This results in the item catalogue being not fully utilised, which is far from ideal from the business' perspective. ...
Keywords: consumer diversity, diversity, item exposure, item-centric evaluation, recommender systems

4 published by ACM
February 2018 WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 18,   Downloads (12 Months): 164,   Downloads (Overall): 164

Full text available: PDFPDF
This paper evaluates two algorithms, BLIP and JLT, for creating differentially private data sketches of user profiles, in terms of their ability to protect a kNN collaborative filtering algorithm from an inference attack by third-parties. The transformed user profiles are employed in a user-based top-N collaborative filtering system. For the ...
Keywords: data sketching, privacy preservation, user-based top-n recommneder, collaborative filtering

5 published by ACM
July 2017 UMAP '17: Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 38,   Downloads (Overall): 65

Full text available: PDFPDF
The intent-aware diversification framework considers a set of aspects associated with items to be recommended. A baseline recommendation is greedily re-ranked using an objective that promotes diversity across the aspects. In this paper the framework is analysed and a new intent-aware objective is derived that considers the minimum variance criterion, ...
Keywords: diversity, intent-aware recommendations, portfolio theory, recommender systems

6 published by ACM
September 2016 RecSys '16: Proceedings of the 10th ACM Conference on Recommender Systems
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 11,   Downloads (12 Months): 99,   Downloads (Overall): 465

Full text available: PDFPDF
The intent-aware diversification framework was introduced initially in information retrieval and adopted to the context of recommender systems in the work of Vargas et al. The framework considers a set of aspects associated with items to be recommended. For instance, aspects may correspond to genres in movie recommendations. The framework ...
Keywords: diversity, intent-aware recommendation, evaluation

7
August 2016 ASONAM '16: Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 0

Full text available: PDFPDF
Blockmodelling is a technique whose aim is to identify meaningful structure in networks. Community finding is a type of blockmodelling in so far as it focuses on identifying dense subgraph structure. Generalised blockmodelling allows an analyst to explicitly control the type of extracted structure. When compared to the well studied ...

8
April 2016 WWW '16: Proceedings of the 25th International Conference on World Wide Web
Publisher: International World Wide Web Conferences Steering Committee
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 8,   Downloads (12 Months): 80,   Downloads (Overall): 340

Full text available: PDFPDF
We address the problem of real-time recommendation of streaming Twitter hashtags to an incoming stream of news articles. The technical challenge can be framed as large scale topic classification where the set of topics (i.e., hashtags) is huge and highly dynamic. Our main applications come from digital journalism, e.g., promoting ...
Keywords: dynamic topics, hashtag recommendation, learning-to-rank, news, social indexing

9 published by ACM
August 2015 ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 7,   Downloads (Overall): 30

Full text available: PDFPDF
Among the many community-finding algorithms that have been proposed in the last decade and more, the Infomap algorithm of Rosvall and Bergstrom has proven among the best. The algorithm finds good community structure in directed as well as undirected networks by abstracting information flow in the network as a random ...

10 published by ACM
October 2014 RecSysChallenge '14: Proceedings of the 2014 Recommender Systems Challenge
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 4,   Downloads (Overall): 54

Full text available: PDFPDF
While much recommender system research has been driven by the rating prediction task, there is an emphasis in recent research on exploring new methods to evaluate the effectiveness of a recommendation. The Recommender Systems Challenge 2014 takes up this theme by challenging researchers to explore engagement as an evaluation criterion. ...

11 published by ACM
October 2014 COSN '14: Proceedings of the second ACM conference on Online social networks
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Downloads (Overall): 59

Full text available: PDFPDF
Community-finding in graphs is the process of identifying highly cohesive vertex subsets. Recently the vertex-centric approach has been found effective for scalable graph processing and is implemented in systems such as GraphLab and Pregel. In the vertex-centric approach, the analysis is decomposed into a set of local computations at each ...
Keywords: iterative local update, community detection algorithms, semi-synchronous graph algorithms, parallel graph algorithms

12
September 2014 ECMLPKDD'14: Proceedings of the 2014th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part III
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We present the Insight4News system that connects news articles to social conversations, as echoed in microblogs such as Twitter. Insight4News tracks feeds from mainstream media, e.g., BBC, Irish Times, and extracts relevant topics that summarize the tweet activity around each article, recommends relevant hashtags, and presents complementary views and statistics ...
Keywords: news tracking, twitter, summarization, social media

13
August 2014 ASONAM '14: Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 0

Full text available: PDFPDF
Community finding in social network analysis is the task of identifying groups of people within a larger population who are more likely to connect to each other than connect to others in the population. Much existing research has focussed on non-overlapping clustering. However, communities in real-world social networks do overlap. ...

14 published by ACM
October 2013 RecSys '13: Proceedings of the 7th ACM conference on Recommender systems
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 6,   Downloads (12 Months): 68,   Downloads (Overall): 458

Full text available: PDFPDF
In this paper we discuss a method to incorporate diversity into a personalised ranking objective, in the context of ranking-based recommendation using implicit feedback. The goal is to provide a ranking of items that respects user preferences while also tending to rank diverse items closely together. A prediction formula is ...
Keywords: diversity, relevance

15 published by ACM
August 2013 ASONAM '13: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 3,   Downloads (12 Months): 20,   Downloads (Overall): 150

Full text available: PDFPDF
In this paper, we present ChurnVis, a system for visualizing components affected by mobile telecommunications churn and subscriber actions over time. We describe our experience of deploying this system in a network analytics company for use in data analysis and presentation tasks. As social influence seems to be a factor ...
Keywords: attributed graphs, telecommunications churn, social networks, visualization

16
April 2013 Computational Statistics & Data Analysis: Volume 60, April, 2013
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

An efficient MCMC algorithm is presented to cluster the nodes of a network such that nodes with similar role in the network are clustered together. This is known as block-modeling or block-clustering. The model is the stochastic blockmodel (SBM) with block parameters integrated out. The resulting marginal distribution defines a ...
Keywords: MCMC, Social networks, Computational statistics, Blockmodeling, Clustering

17
December 2012 WI-IAT '12: Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 5,   Downloads (Overall): 53

Full text available: PDFPDF
In this paper we attempt to retrieve the items in the long-tail for top-N recommendation. That is, to recommend products that the end-user likes, but that are not generally popular, which has been getting more and more notice lately. By analysing the existing issue of current recommendation algorithms, a strategy ...
Keywords: long-tail, top-N recommendation, popularity

18
August 2012 ASONAM '12: Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 3,   Downloads (Overall): 37

Full text available: PDFPDF
K-clique percolation is an overlapping community finding algorithm which extracts particular structures, comprised of overlapping cliques, from complex networks. While it is conceptually straightforward, and can be elegantly expressed using clique graphs, certain aspects of k-clique percolation are computationally challenging in practice. In this paper we investigate aspects of empirical ...
Keywords: Percolation, Complex Networks, Social Networks, Network Analysis, Scalability

19 published by ACM
May 2012 AVI '12: Proceedings of the International Working Conference on Advanced Visual Interfaces
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 192

Full text available: PDFPDF
EgoNav is a visual analytics system that characterizes egos based on the relationship structure of their egocentric networks and presents the results as a spatialization. An ego, or individual node in a network, is most closely related to its neighbors, and to a lesser degree, to its neighbor's neighbors. For ...
Keywords: network motif analysis, spatializations, visual analytics

20
December 2011 ICDMW '11: Proceedings of the 2011 IEEE 11th International Conference on Data Mining Workshops
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

In this work we study diffusion in networks with community structure. We first replicate and extend work on networks with non-overlapping community structure. We then study diffusion on network models that have overlapping community structure. We study contagions in the standard SIR model, and complex contagions thought to be better ...
Keywords: Networks, Diffusion, Epidemic, Spread, Contagion, Overlapping, Structure, Community



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us