|
ROLE
 Author only
BOOKMARK & SHARE
|
|
1
January 2016
ACM Transactions on Knowledge Discovery from Data (TKDD): Volume 10 Issue 3, February 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 8, Downloads (12 Months): 99, Downloads (Overall): 326
Full text available:
 PDF
Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its applications in many fields such as biology, social networks, or network traffic analysis. Although the existing metrics used to quantify the quality of a community work well in general, ...
Keywords:
Community detection, social networks, parallel algorithm, scalable algorithm, triangles
2
May 2015
WWW '15 Companion: Proceedings of the 24th International Conference on World Wide Web
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7, Downloads (12 Months): 65, Downloads (Overall): 120
Full text available:
PDF
Community detection has become an extremely active area of research in recent years, with researchers proposing various new metrics and algorithms to address the problem. Recently, the Weighted Community Clustering (WCC) metric was proposed as a novel way to judge the quality of a community partitioning based on the distribution ...
Keywords:
distributed graph algorithms, community detection
3
June 2014
GRADES'14: Proceedings of Workshop on GRAph Data management Experiences and Systems
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3, Downloads (12 Months): 14, Downloads (Overall): 53
Full text available:
PDF
Social-like graph generators have become an indispensable tool when designing proper evaluation methodologies for social graph applications, algorithms and systems. Existing synthetic generators have been designed to produce data with characteristics similar to those found in real graphs, such as power-law degree distributions, a large clustering coefficient or a small ...
4
June 2014
GRADES'14: Proceedings of Workshop on GRAph Data management Experiences and Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2, Downloads (12 Months): 23, Downloads (Overall): 73
Full text available:
PDF
Graph data processing is gaining popularity and new solutions are appearing to analyze graphs efficiently. In this paper, we present the prototype for the new query engine of the Sparksee graph database, which is based on an algebra of operations on sets of key-value pairs. The new engine combines some ...
5
April 2014
WWW '14: Proceedings of the 23rd international conference on World wide web
Publisher: ACM
Bibliometrics:
Citation Count: 10
Downloads (6 Weeks): 13, Downloads (12 Months): 86, Downloads (Overall): 612
Full text available:
PDF
Community detection has arisen as one of the most relevant topics in the field of graph mining, principally for its applications in domains such as social or biological networks analysis. Different community detection algorithms have been proposed during the last decade, approaching the problem from different perspectives. However, existing algorithms ...
Keywords:
clustering, social networks, WC, community detection, graph partition, graph algorithms, modularity, parallel
6
April 2014
ICMR '14: Proceedings of International Conference on Multimedia Retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2, Downloads (12 Months): 13, Downloads (Overall): 166
Full text available:
PDF
Annotation-based techniques for image retrieval suffer from sparse and short image textual descriptions. Moreover, users are often not able to describe their needs with the most appropriate keywords. This situation is a breeding ground for a vocabulary mismatch problem resulting in poor results in terms of retrieval precision. In this ...
Keywords:
Information retrieval, Wikipedia, query expansion, community detection, graph mining techniques, knowledge bases
7
October 2013
CloudDB '13: Proceedings of the fifth international workshop on Cloud data management
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2, Downloads (12 Months): 13, Downloads (Overall): 155
Full text available:
PDF
Vertex centric computation implemented with a Bulk Synchronous Parallel (BSP) model is becoming a popular choice to analyze huge graphs. In this paper, we study the impact of the graph partitioning strategies for BSP by simulating different partitions of the vertices of the graph. We also consider the impact of ...
Keywords:
bsp, bulk synchronous parallel, distributed processing, graph processing, simulator
8
July 2013
ACM SIGMOD Record: Volume 42 Issue 2, May 2013
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2, Downloads (12 Months): 8, Downloads (Overall): 64
Full text available:
PDF
Endogamy in scientific publications is a measure of the degree of collaboration between researchers. In this paper, we analyze the endogamy of a large set of computer science conferences and journals. We observe a strong correlation between the quality of those conferences and the endogamy of their authors: conferences where ...
9
June 2013
GRADES '13: First International Workshop on Graph Data Management Experiences and Systems
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 4, Downloads (12 Months): 66, Downloads (Overall): 390
Full text available:
PDF
Graphs have become an indispensable tool for the analysis of linked data. As with any data representation, the need for using database management systems appears when they grow in size and complexity. Associated to those needs, benchmarks appear to assess the performance of such systems in specific scenarios, representative of ...
10
February 2013
ARCS'13: Proceedings of the 26th international conference on Architecture of Computing Systems
Publisher: Springer-Verlag
The massive addition of cores on a chip is adding more pressure to the accesses to main memory. In order to avoid this bottleneck, we propose the use of a simple producer-consumer model, which allows for the temporary results to be transferred directly from one task to another. These data ...
11
October 2012
CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 5, Downloads (12 Months): 37, Downloads (Overall): 247
Full text available:
PDF
Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its importance in many fields such as biology, social networks or network traffic analysis. The metrics proposed to shape communities are too lax and do not consider the internal layout ...
Keywords:
conductance, modularity, social networks, community detection
12
August 2012
IDEAS '12: Proceedings of the 16th International Database Engineering & Applications Sysmposium
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 8, Downloads (12 Months): 85, Downloads (Overall): 522
Full text available:
PDF
The increasing amount of graph like data from social networks, science and the web has grown an interest in analyzing the relationships between different entities. New specialized solutions in the form of graph databases, which are generic and able to adapt to any schema as an alternative to RDBMS, have ...
Keywords:
query performance, data representation, graph databases
13
April 2012
WWW '12 Companion: Proceedings of the 21st International Conference on World Wide Web
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 4, Downloads (12 Months): 23, Downloads (Overall): 175
Full text available:
PDF
A social role is a set of characteristics that describe the behavior of individuals and their interactions between them within a social context. In this paper, we describe the architecture of a search engine for detecting roles in a social network. Our approach, based on indexed clusters, gives the user ...
Keywords:
social networks, twitter, role search
14
April 2012
IEEE Transactions on Parallel and Distributed Systems: Volume 23 Issue 4, April 2012
Publisher: IEEE Press
We propose and analyze a distributed cooperative caching strategy based on the Evolutive Summary Counters (ESC), a new data structure that stores an approximated record of the data accesses in each computing node of a search engine. The ESC capture the frequency of accesses to the elements of a data ...
Keywords:
Distributed systems, distributed caching, resource intensive applications, count filter.
15
September 2011
IDEAS '11: Proceedings of the 15th Symposium on International Database Engineering & Applications
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2, Downloads (12 Months): 22, Downloads (Overall): 305
Full text available:
PDF
The need for managing massive attributed graphs is becoming common in many areas such as recommendation systems, proteomics analysis, social network analysis or bibliographic analysis. This is making it necessary to move towards parallel systems that allow managing graph databases containing millions of vertices and edges. Previous work on distributed ...
Keywords:
graph algorithms, replication and caching, distributed graphs, distributed and parallel computing, distributed and parallel databases, cache specialization, graph database
16
April 2011
DASFAA'11: Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Publisher: Springer-Verlag
Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy. Here, we propose layout strategies based on community detection to ...
Keywords:
graph mining, community detection, performance
17
September 2010
TPCTC'10: Proceedings of the Second TPC technology conference on Performance evaluation, measurement and characterization of complex systems
Publisher: Springer-Verlag
Graph Database Management systems (GDBs) are gaining popularity. They are used to analyze huge graph datasets that are naturally appearing in many application areas to model interrelated data. The objective of this paper is to raise a new topic of discussion in the benchmarking community and allow practitioners having a ...
18
September 2010
Proceedings of the VLDB Endowment: Volume 3 Issue 1-2, September 2010
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2, Downloads (12 Months): 39, Downloads (Overall): 222
Full text available:
PDF
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacement Selection (RS) because, on average, it generates runs that are twice the size of the memory available. However, the length of ...
Keywords:
heap sort, out of core sorting, external sorting, sorting, merge sort, replacement selection, run formation
19
July 2010
WAIM'10: Proceedings of the 2010 international conference on Web-age information management
Publisher: Springer-Verlag
The analysis of the relationship among data entities has lead to model them as graphs. Since the size of the datasets has significantly grown in the recent years, it has become necessary to implement efficient graph databases that can load and manage these huge datasets. In this paper, we evaluate ...
20
June 2009
HPCC '09: Proceedings of the 2009 11th IEEE International Conference on High Performance Computing and Communications
Publisher: IEEE Computer Society
In this paper we study the performance of a distributed search engine from a data caching point of view. We compare and combine two different approaches to achieve better hit rates: (a) send the queries to the node which currently has the related data in its local memory (cache-aware load ...
Keywords:
Question Answering, cooperative caching, load balancing, distributed systems
|
|
