305 Hits in 9.0 sec

Efficient query recommendations in the long tail via center-piece subgraphs

Francesco Bonchi, Raffaele Perego, Fabrizio Silvestri, Hossein Vahabi, Rossano Venturini
2012 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12  
We present a recommendation method based on the wellknown concept of center-piece subgraph, that allows for the time/space efficient generation of suggestions also for rare, i.e., long-tail queries.  ...  On such large graph we need to compute the center-piece subgraph induced by terms contained into queries.  ...  We overcome to this limitation by introducing a novel and efficient way to compute center-piece subgraphs.  ... 
doi:10.1145/2348283.2348332 dblp:conf/sigir/BonchiPSVV12 fatcat:6yjh6rgx7zfx3g3yssehij7sum

Searching connected API subgraph via text phrases

Wing-Kwan Chan, Hong Cheng, David Lo
2012 Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering - FSE '12  
We conduct extensive experiments to show that the proposed subgraph search approach for API recommendation is very effective in that it boosts the average F1-measure of the state-of-theart approach, Portfolio  ...  Furthermore, as the greedy subgraph search algorithm relies on online query of shortest path between two graph nodes, we propose a spaceefficient compressed shortest path indexing scheme that can efficiently  ...  Finally, from a total of 83 pieces of sample code in the candidate pool, we select 20 pieces of sample code by including various packages in the JSE 1.6 library. Group II Queries.  ... 
doi:10.1145/2393596.2393606 dblp:conf/sigsoft/ChanCL12 fatcat:ghpfpik3njez5hcayidjdntjsq

Structural Sparsity of Complex Networks: Bounded Expansion in Random Models and Real-World Graphs [article]

Erik D. Demaine and Felix Reidl and Peter Rossmanith and Fernando Sanchez Villaamil and Somnath Sikdar and Blair D. Sullivan
2018 arXiv   pre-print
In contrast, we show that the Kleinberg and the Barabasi-Albert model have unbounded expansion. We support our findings with empirical measurements on a corpus of real-world networks.  ...  This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network  ...  Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author(s) and do not necessarily reflect the views of DARPA, SSC Pacific, AFOSR, the Moore Foundation  ... 
arXiv:1406.2587v6 fatcat:re6o4v32wjdavhlgtdjpnhdhwu

29th International Conference on Data Engineering [book of abstracts]

2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
Thus, a road network spatial alarm is a star-like subgraph centered at the alarm target.  ...  via the views.  ...  These volunteers welcome participants, give directions, help in the sessions and on the registration desk, and generally make sure the conference is running smoothly.  ... 
doi:10.1109/icdew.2013.6547409 fatcat:wadzpuh3b5htli4mgb4jreoika

Big Data Methods for Computational Linguistics

Gerhard Weikum, Johannes Hoffart, Ndapandula Nakashole, Marc Spaniol, Fabian M. Suchanek, Mohamed Amir Yosef
2012 IEEE Data Engineering Bulletin  
We demonstrate a virtuous cycle in harvesting knowledge from large data and text collections and leveraging this knowledge in order to improve the annotation and interpretation of language in Web pages  ...  The availability of big data, from the Web and other sources, has changed this situation. Harnessing these assets requires scalable methods for data and text analytics.  ...  tail.  ... 
dblp:journals/debu/WeikumHNSSY12 fatcat:vmtel42ji5dfrebgn3ekt4lude

Why-query support in graph databases

Elena Vasilyeva
2016 2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)  
The first type identifies the reasons of unexpectedness in terms of query subgraphs and delivers differential graphs as answers.  ...  The second one reformulates queries in such a way that they produce better results.  ...  This type of queries is specifically useful in marketing research and recommendations.  ... 
doi:10.1109/icdew.2016.7495652 dblp:conf/icde/Vasilyeva16 fatcat:snct4vcbsrf4rpdjjbqtxyzpq4

Ranking queries on uncertain data

Ming Hua, Jian Pei, Xuemin Lin
2010 The VLDB journal  
Second, we compute three pieces of information, the approximate center, the radius, and the a-neighborhood, for each node in the LT-tree. Approximate center.  ...  The instance in R of the minimum center-score is chosen as the center. This center approximation procedure is popularly used in computational geometry. a-neighborhood.  ... 
doi:10.1007/s00778-010-0196-4 fatcat:xogk2bxoyfbapdjvjdmrfdseua

A Survey of Heterogeneous Information Network Analysis [article]

Chuan Shi, Yitong Li, Jiawei Zhang, Yizhou Sun, Philip S. Yu
2015 arXiv   pre-print
meaning of structural types of objects and links in the networks.  ...  the networks.  ...  [60] propose a similarity measure to compute similarity between centers in an x-star network according to the attribute similarities and the connections among centers. B.  ... 
arXiv:1511.04854v1 fatcat:n2k3sulq3fbq3e34lrfrv3uoou

User Group Analytics Survey and Research Opportunities

Behrooz Omidvar-Tehrani, Sihem Amer-Yahia
2019 IEEE Transactions on Knowledge and Data Engineering  
We also discuss challenges and future directions of having an all-in-one system, where all those components are combined. This survey has been presented in the form of two tutorials [1], [2] .  ...  It is also appealing to users in their role as information consumers who use the social Web for routine tasks such as finding a book club or choosing a physical activity.  ...  we e blending of visual subgraph query formucessing.  ... 
doi:10.1109/tkde.2019.2913651 fatcat:6csthrt4zngqzkaur2lfytrupq

Explicit graphs in a functional model for spatial databases

M. Erwig, R.H. Guting
1994 IEEE Transactions on Knowledge and Data Engineering  
The properties of spatially embedded networks can be used to obtain more efficient algorithms than is possible in the general case [49, 20] .  ...  Graph operations are to be implemented on the basis of efficient graph algorithms.  ...  Acknowledgements We would like to thank the referees for their detailed comments and suggestions that helped to improve the paper.  ... 
doi:10.1109/69.317707 fatcat:jkcbi7ygwfeffdvqjlogfqateq

Tracking and analyzing TV content on the web through social and ontological knowledge

Alessio Antonini, Ruggero G. Pensa, Maria Luisa Sapino, Claudio Schifanella, Raffaele Teraoni Prioletti, Luca Vignaroli
2013 Proceedings of the 11th european conference on Interactive TV and video - EuroITV '13  
and social networks, which play a role in what we call the "extended life" of TV content.  ...  With the goal of leveraging users' social activities to better understand how TV programs are perceived by the TV public and how the users' interests evolve in time, we introduce a knowledge graph to model  ...  again to them, exploiting at best the "long tail" phenomena relevant to its own television content.  ... 
doi:10.1145/2465958.2465978 dblp:conf/euroitv/AntoniniPSSPV13 fatcat:whmp2tr37vh6nognkvy5u4qkpe

Graph mining

Deepayan Chakrabarti, Christos Faloutsos
2006 ACM Computing Surveys  
These and similar questions are important in many fields where the data can intuitively be cast as a graph; examples range from computer networks to sociology to biology and many more.  ...  Indeed, any M : N relation in database terminology can be represented as a graph. A lot of these questions boil down to the following: "How can we generate synthetic but realistic graphs?"  ...  This path of referrals might give the user a measure of trust in the recommended expert; it might also encourage the expert to answer the user's query.  ... 
doi:10.1145/1132952.1132954 fatcat:jbc67scdzbe4vj5o5fjerdy6xq

Towards Efficient and Scalable Data-Intensive Content Delivery: State-of-the-Art, Issues and Challenges [chapter]

Irene Kilanioti, Alejandro Fernández-Montes, Damián Fernández-Cerero, Anthony Karageorgos, Christos Mettouris, Valentina Nejkovic, Nikolas Albanis, Rabih Bashroush, George A. Papadopoulos
2019 Msphere  
social media streams and the infrastructure of the data centers supporting the efficient access to data streams in terms of content distribution, data diffusion, data replication, energy efficiency and  ...  In our works, in the framework of the Action, we came up with  ...  User-generated multimedia content is especially difficult due to its long tail nature, with each item probably not popular enough to be replicated in a global scale, but with the long-tail altogether getting  ... 
doi:10.1007/978-3-030-16272-6_4 fatcat:qe35ltdzozfylax3q5taphzjf4

Diversifying Group Recommendation

Nguyen Thanh Toan, Phan Thanh Cong, Nguyen Thanh Tam, Nguyen Quoc Viet Hung, Bela Stantic
2018 IEEE Access  
In this paper, we address the problem of diversity in group recommendation by improving the chance of returning at least one piece of information that embraces group satisfaction.  ...  Experiments on real-world rating datasets show the efficiency and effectiveness of our approach.  ...  The core of recommender systems is the recommendation mechanisms, which suggest to user a selected set of items supposed to match user true intent, often via the relevancy notion of user queries or preferences  ... 
doi:10.1109/access.2018.2815740 fatcat:eznswqtbijas7mawdfjsfytdqu

Social Network Analysis in Enterprise

Ching-Yung Lin, Lynn Wu, Zhen Wen, Hanghang Tong, Vicky Griffiths-Fisher, Lei Shi, David Lubensky
2012 Proceedings of the IEEE  
visualization in large-scale organization; and graph query and mining.  ...  The study is based on an SNA tool (SmallBlue) that was designed to overcome practical challenges and is based on the data collected in a global organization of more than 400 000 employees in more than  ...  ABOUT THE AUTHORS  ... 
doi:10.1109/jproc.2012.2203090 fatcat:35hseog3lvfjjnbqbdkmtgxlom
« Previous Showing results 1 — 15 out of 305 results