Search For:

Displaying 1-49 out of 49 total
Mining Summaries of Propagations
Found in: 2013 IEEE International Conference on Data Mining (ICDM)
By Lucrezia Macchia,Francesco Bonchi,Francesco Gullo,Luca Chiarandini
Issue Date:December 2013
pp. 498-507
Analyzing the traces left by a meme of information propagating through a social network or by a user browsing a website can help to unveil the structure and dynamics of such complex networks. This may in turn open the door to concrete applications, such as...
 
Influence Propagation in Social Networks: A Data Mining Perspective
Found in: Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on
By Francesco Bonchi
Issue Date:August 2011
pp. 2
No summary available.
 
Influence Propagation in Social Networks: A Data Mining Perspective
Found in: Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on
By Francesco Bonchi
Issue Date:August 2011
pp. 2
No summary available.
 
Viscous democracy for social networks
Found in: Communications of the ACM
By Carlos Castillo, Francesco Bonchi, Francesco Bonchi, Paolo Boldi, Paolo Boldi, Sebastiano Vigna, Sebastiano Vigna
Issue Date:June 2011
pp. 129-137
Decision-making procedures in online social networks should reflect participants' political influence within the network.
     
Composite Retrieval of Diverse and Complementary Bundles
Found in: IEEE Transactions on Knowledge and Data Engineering
By Sihem Amer-Yahia,Francesco Bonchi,Carlos Castillo,Esteban Feuerstein,Isabel Mendez-Diaz,Paula Zabala
Issue Date:November 2014
pp. 2662-2675
Users are often faced with the problem of finding complementary items that together achieve a single common goal (e.g., a starter kit for a novice astronomer, a collection of question/answers related to low-carb nutrition, a set of places to visit on holid...
 
Influence-Based Network-Oblivious Community Detection
Found in: 2013 IEEE International Conference on Data Mining (ICDM)
By Nicola Barbieri,Francesco Bonchi,Giuseppe Manco
Issue Date:December 2013
pp. 955-960
How can we detect communities when the social graphs is not available? We tackle this problem by modeling social contagion from a log of user activity, that is a dataset of tuples (u, i, t) recording the fact that user u "adopted" item i at time ...
 
Topic-Aware Social Influence Propagation Models
Found in: 2012 IEEE 12th International Conference on Data Mining (ICDM)
By Nicola Barbieri,Francesco Bonchi,Giuseppe Manco
Issue Date:December 2012
pp. 81-90
We study social influence from a topic modeling perspective. We introduce novel topic-aware influence-driven propagation models that experimentally result to be more accurate in describing real-world cascades than the standard propagation models studied in...
 
Overlapping Correlation Clustering
Found in: Data Mining, IEEE International Conference on
By Francesco Bonchi,Aristides Gionis,Antti Ukkonen
Issue Date:December 2011
pp. 51-60
We introduce a new approach to the problem of overlapping clustering. The main idea is to formulate overlapping clustering as an optimization problem in which each data point is mapped to a small set of labels, representing membership to different clusters...
 
Diverse Dimension Decomposition of an Itemset Space
Found in: Data Mining, IEEE International Conference on
By Mikalai Tsytsarau,Francesco Bonchi,Aristides Gionis,Themis Palpanas
Issue Date:December 2011
pp. 725-734
We introduce the problem of diverse dimension decomposition in transactional databases. A dimension is a set of mutually-exclusive item sets, and our problem is to find a decomposition of the item set space into dimensions, which are orthogonal to each oth...
 
Identity obfuscation in graphs through the information theoretic lens
Found in: Data Engineering, International Conference on
By Francesco Bonchi,Aristides Gionis,Tamir Tassa
Issue Date:April 2011
pp. 924-935
Analyzing the structure of social networks is of interest in a wide range of disciplines, but such activity is limited by the fact that these data represent sensitive information and can not be published in their raw form. One of the approaches to sanitize...
 
The Meme Ranking Problem: Maximizing Microblogging Virality
Found in: Data Mining Workshops, International Conference on
By Dino Ienco, Francesco Bonchi, Carlos Castillo
Issue Date:December 2010
pp. 328-335
Microblogging is a communication paradigm in which users post bits of information (brief text updates or micro media such as photos, video or audio clips) that are visible by their communities. When a user finds a “meme” of another user interesting, she ca...
 
Learning and Predicting the Evolution of Social Networks
Found in: IEEE Intelligent Systems
By Bjoern Bringmann, Michele Berlingerio, Francesco Bonchi, Arisitdes Gionis
Issue Date:July 2010
pp. 26-35
<p>Graph Evolution Rules help in analyzing the evolution of large networks and can be used to predict the future creation of links among nodes.</p>
 
Hiding Sequential and Spatiotemporal Patterns
Found in: IEEE Transactions on Knowledge and Data Engineering
By Osman Abul, Francesco Bonchi, Fosca Giannotti
Issue Date:December 2010
pp. 1709-1723
The process of discovering relevant patterns holding in a database was first indicated as a threat to database security by O'Leary in [CHECK END OF SENTENCE]. Since then, many different approaches for knowledge hiding have emerged over the years, mainly in...
 
From
Found in: Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on
By Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna
Issue Date:September 2009
pp. 183-190
Understanding query reformulation patterns is a key step towards next generation web search engines: it can help improving users' web-search experience by predicting their intent, and thus helping them to locate information more effectively. As a step in t...
 
GuruMine: A Pattern Mining System for Discovering Leaders and Tribes
Found in: Data Engineering, International Conference on
By Amit Goyal, Byung-Won On, Francesco Bonchi, Laks V. S. Lakshmanan
Issue Date:April 2009
pp. 1471-1474
In this demo we introduce GuruMine, a pattern mining system for the discovery of leaders, i.e., influential users in social networks, and their tribes, i.e., a set of users usually influenced by the same leader over several actions. GuruMine is built upon ...
 
Sequence Mining Automata: A New Technique for Mining Frequent Sequences under Regular Expressions
Found in: Data Mining, IEEE International Conference on
By Roberto Trasarti, Francesco Bonchi, Bart Goethals
Issue Date:December 2008
pp. 1061-1066
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space, pushing (in some way) the given regular expression to prune unpromising cand...
 
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Found in: Data Engineering, International Conference on
By Osman Abul, Francesco Bonchi, Mirco Nanni
Issue Date:April 2008
pp. 376-385
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such that each individual is indistinguishable from at least k - 1 other individual...
 
Mining Clinical Data with a Temporal Dimension: A Case Study
Found in: Bioinformatics and Biomedicine, IEEE International Conference on
By Michele Berlingerio, Francesco Bonchi, Fosca Giannotti, Franco Turini
Issue Date:November 2007
pp. 429-436
Clinical databases store large amounts of information about patients and their medical conditions. Data mining techniques can extract relationships and patterns holding in this wealth of data, and thus be helpful in understand- ing the progression of disea...
 
Hiding Sensitive Trajectory Patterns
Found in: Data Mining Workshops, International Conference on
By Osman Abul, Maurizio Atzori, Francesco Bonchi, Fosca Giannotti
Issue Date:October 2007
pp. 693-698
Spatio-temporal traces left behind by moving individuals are increasingly available. On the one hand, mining this kind of data is expected to produce interesting behavioral knowledge enabling novel classes of mobility applications; but on the other hand, d...
 
Time-Annotated Sequences for Medical Data Mining
Found in: Data Mining Workshops, International Conference on
By Michele Berlingerio, Francesco Bonchi, Fosca Giannotti, Franco Turini
Issue Date:October 2007
pp. 133-138
A typical structure of medical data is a sequence of ob- servations of clinical parameters taken at different time mo- ments. In this kind of contexts, the temporal dimension of data is a fundamental variable that should be taken into account in the mining...
 
Privacy-Aware Knowledge Discovery from Location Data
Found in: Mobile Data Management, IEEE International Conference on
By Maurizio Atzori, Francesco Bonchi, Fosca Giannotti, Dino Pedreschi, Osman Abul
Issue Date:May 2007
pp. 283-287
No summary available.
 
Hiding Sequences
Found in: Data Engineering Workshops, 22nd International Conference on
By Osman Abul, Maurizio Atzori, Francesco Bonchi, Fosca Giannotti
Issue Date:April 2007
pp. 147-156
The process of discovering relevant patterns holding in a database, was first indicated as a threat to database security by O' Leary in [20]. Since then, many different approaches for knowledge hiding have emerged over the years, mainly in the context of a...
 
Mining HLA Patterns Explaining Liver Diseases
Found in: Computer-Based Medical Systems, IEEE Symposium on
By Michele Berlingerio, Francesco Bonchi, Silvia Chelazzi, Michele Curcio, Fosca Giannotti, Fabrizio Scatena
Issue Date:June 2006
pp. 702-707
HumanLeukocyteAntigens (HLA), also known as histocompatibility antigens, are molecules found on all nucleated cells in the body. Histocompatibility antigens help the immune system to recognize whether or not a cell is foreign to the body, hence the success...
 
ConQueSt: a Constraint-based Querying System for Exploratory Pattern Discovery
Found in: Data Engineering, International Conference on
By Francesco Bonchi, Fosca Giannotti, Claudio Lucchese, Salvatore Orlando, Raffaele Perego, Roberto Trasarti
Issue Date:April 2006
pp. 159
ConQueSt is a constraint-based querying system devised with the aim of supporting the intrinsically exploratory nature of pattern discovery. It provides users with an expressive constraint-based query language which allows the discovery process to be effec...
 
Blocking Anonymity Threats Raised by Frequent Itemset Mining
Found in: Data Mining, IEEE International Conference on
By Maurizio Atzori, Francesco Bonchi, Fosca Giannotti, Dino Pedreschi
Issue Date:November 2005
pp. 561-564
In this paper we study when the disclosure of datamining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty of our approach is that we focus on an objective definition of privacy complian...
 
ExAnte: A Preprocessing Method for Frequent-Pattern Mining
Found in: IEEE Intelligent Systems
By Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, Dino Pedreschi
Issue Date:May 2005
pp. 25-31
ExAnte is a simple yet effective approach for preprocessing input data for mining frequent patterns. The approach questions established research in that it requires no trade-off between antimonotonicity and monotonicity. Indeed, ExAnte relies on a strong s...
 
On Closed Constrained Frequent Pattern Mining
Found in: Data Mining, IEEE International Conference on
By Francesco Bonchi, Claudio Lucchese
Issue Date:November 2004
pp. 35-42
Constrained frequent patterns and closed frequent patterns are two paradigms aimed at reducing the set of extracted patterns to a smaller, more interesting, subset. Although a lot of work has been done with both these paradigms, there is still confusion ar...
 
ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraints
Found in: Data Mining, IEEE International Conference on
By Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, Dino Pedreschi
Issue Date:November 2003
pp. 11
The key point of this paper is that, in frequent pattern mining, the most appropriate way of exploiting monotone constraints in conjunction with frequency is to use them in order to reduce the problem input together with the search space. Following this in...
 
Data Mining for Intelligent Web Caching
Found in: Information Technology: Coding and Computing, International Conference on
By Francesco Bonchi, Fosca Giannotti, Giuseppe Manco, Chiara Renso, Mirco Nanni, Dino Pedreschi, Salvatore Ruggieri
Issue Date:April 2001
pp. 0599
Abstract: The paper presents a vertical application of data warehousing and data mining technology: intelligent web caching. We introduce several ways to construct intelligent web caching algorithms that employ predictive models of web requests; the genera...
 
Chromatic correlation clustering
Found in: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '12)
By Antti Ukkonen, Aristides Gionis, Francesco Bonchi, Francesco Gullo
Issue Date:August 2012
pp. 1321-1329
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges are of different types (colors). We introduce an objective function that aims ...
     
Introduction to the special issue on social web mining
Found in: ACM Transactions on Intelligent Systems and Technology (TIST)
By Francesco Bonchi, Ricard Gavaldá, Shengbo Guo, Wray Buntine
Issue Date:December 2013
pp. 1-2
With ubiquitous wireless connectivity and technological advances in mobile devices, we witness the growing demands and increasing market shares of mobile intelligent systems and technologies for real-time decision making and location-based knowledge discov...
     
Interactive and context-aware tag spell check and correction
Found in: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM '12)
By Fabrizio Silvestri, Francesco Bonchi, Franco Maria Nardini, Hossein Vahabi, Ophir Frieder
Issue Date:October 2012
pp. 1869-1873
Collaborative content creation and annotation creates vast repositories of all sorts of media, and user-defined tags play a central role as they are a simple yet powerful tool for organizing, searching and exploring the available resources. We observe that...
     
The early-adopter graph and its application to web-page recommendation
Found in: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM '12)
By Aristides Gionis, Francesco Bonchi, Ida Mele
Issue Date:October 2012
pp. 1682-1686
In this paper we present a novel graph-based data abstraction for modeling the browsing behavior of web users. The objective is to identify users who discover interesting pages before others. We call these users early adopters. By tracking the browsing act...
     
Efficient query recommendations in the long tail via center-piece subgraphs
Found in: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval (SIGIR '12)
By Fabrizio Silvestri, Francesco Bonchi, Hossein Vahabi, Raffaele Perego, Rossano Venturini
Issue Date:August 2012
pp. 345-354
We present a recommendation method based on the well-known concept of center-piece subgraph, that allows for the time/space efficient generation of suggestions also for rare, i.e., long-tail queries. Our method is scalable with respect to both the size of ...
     
Suggesting ghost edges for a smaller world
Found in: Proceedings of the 20th ACM international conference on Information and knowledge management (CIKM '11)
By Aristides Gionis, Francesco Bonchi, Manos Papagelis
Issue Date:October 2011
pp. 2305-2308
Small changes in the network topology can have dramatic effects on its capacity to disseminate information. In this paper, we consider the problem of adding a small number of ghost edges in the network in order to minimize the average shortest-path distanc...
     
Social Network Analysis and Mining for Business Applications
Found in: ACM Transactions on Intelligent Systems and Technology (TIST)
By Alejandro Jaimes, Aristides Gionis, Carlos Castillo, Francesco Bonchi
Issue Date:April 2011
pp. 1-37
Social network analysis has gained significant attention in recent years, largely due to the success of online social networking and media-sharing sites, and the consequent availability of a wealth of social network data. In spite of the growing interest, ...
     
Recommendations for the long tail by term-query graph
Found in: Proceedings of the 20th international conference companion on World wide web (WWW '11)
By Fabrizio Silvestri, Francesco Bonchi, Hossein Vahabi, Raffaele Perego, Rossano Venturini
Issue Date:March 2011
pp. 15-16
We define a new approach to the query recommendation problem. In particular, our main goal is to design a model enabling the generation of query suggestions also for rare and previously unseen queries. In other words we are targeting queries in the long ta...
     
Cold start link prediction
Found in: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '10)
By B. Barla Cambazoglu, Francesco Bonchi, Vincent Leroy
Issue Date:July 2010
pp. 393-402
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely to appear in the future. In this paper, we introduce cold start link predicti...
     
Learning influence probabilities in social networks
Found in: Proceedings of the third ACM international conference on Web search and data mining (WSDM '10)
By Amit Goyal, Francesco Bonchi, Laks V.S. Lakshmanan
Issue Date:February 2010
pp. 241-250
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a social graph with edges labeled with probabilities of influence between users...
     
Compressing tags to find interesting media groups
Found in: Proceeding of the 18th ACM conference on Information and knowledge management (CIKM '09)
By Arno Siebes, Borkur Sigurbjornsson, Francesco Bonchi, Matthijs van Leeuwen
Issue Date:November 2009
pp. 1147-1156
On photo sharing websites like Flickr and Zooomr, users are offered the possibility to assign tags to their uploaded pictures. Using these tags to find interesting groups of semantically related pictures in the result set of a given query is a problem with...
     
Fast shortest path distance estimation in large networks
Found in: Proceeding of the 18th ACM conference on Information and knowledge management (CIKM '09)
By Aristides Gionis, Carlos Castillo, Francesco Bonchi, Michalis Potamias
Issue Date:November 2009
pp. 867-876
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landmarks and computing offline the distances from each node in the graph to those...
     
Voting in social networks
Found in: Proceeding of the 18th ACM conference on Information and knowledge management (CIKM '09)
By Carlos Castillo, Francesco Bonchi, Paolo Boldi, Sebastiano Vigna
Issue Date:November 2009
pp. 777-786
A voting system is a set of rules that a community adopts to take collective decisions. In this paper we study voting systems for a particular kind of community: electronically mediated social networks. In particular, we focus on delegative democracy (a.k....
     
Anonymizing moving objects: how to hide a MOB in a crowd?
Found in: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT '09)
By Francesco Bonchi, Laks V. S. Lakshmanan, Roman Yarovoy, Wendy Hui Wang
Issue Date:March 2009
pp. 94-104
Moving object databases (MOD) have gained much interest in recent years due to the advances in mobile communications and positioning technologies. Study of MOD can reveal useful information (e.g., traffic patterns and congestion trends) that can be used in...
     
Query suggestions using query-flow graphs
Found in: Proceedings of the 2009 workshop on Web Search Click Data (WSCD '09)
By Carlos Castillo, Debora Donato, Francesco Bonchi, Paolo Boldi, Sebastiano Vigna
Issue Date:February 2009
pp. 56-63
The query-flow graph [Boldi et al., CIKM 2008] is an aggregated representation of the latent querying behavior contained in a query log. Intuitively, in the query-flow graph a directed edge from query qi to query qj means that the two queries are likely to...
     
Optimising topical query decomposition
Found in: Proceedings of the 2009 workshop on Web Search Click Data (WSCD '09)
By Carlos Castillo, Debora Donato, Francesco Bonchi, Marcin Sydow
Issue Date:February 2009
pp. 43-47
Topical query decomposition (TQD) is a paradigm recently introduced in [1], which, given a query, returns to the user a set of queries that cover the answer set of the original query. The TQD problem was studied as a variant of the set-cover problem and so...
     
The query-flow graph: model and applications
Found in: Proceeding of the 17th ACM conference on Information and knowledge mining (CIKM '08)
By Aristides Gionis, Carlos Castillo, Debora Donato, Francesco Bonchi, Paolo Boldi, Sebastiano Vigna
Issue Date:October 2008
pp. 1001-1001
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior of the users, as well as their implicit feedback to search engine results. Mi...
     
Discovering leaders from community actions
Found in: Proceeding of the 17th ACM conference on Information and knowledge mining (CIKM '08)
By Amit Goyal, Francesco Bonchi, Laks V.S. Lakshmanan
Issue Date:October 2008
pp. 1001-1001
We introduce a novel frequent pattern mining approach to discover leaders and tribes in social networks. In particular, we consider social networks where users perform actions. Actions may be as simple as tagging resources (urls) as in del.icio.us, rating ...
     
Topical query decomposition
Found in: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '08)
By Aristides Gionis, Carlos Castillo, Debora Donato, Francesco Bonchi
Issue Date:August 2008
pp. 5-6
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting documents corresponds approximately to that of the original query. Ideally, ...
     
Towards low-perturbation anonymity preserving pattern discovery
Found in: Proceedings of the 2006 ACM symposium on Applied computing (SAC '06)
By Dino Pedreschi, Fosca Giannott, Francesco Bonchi, Maurizio Atzori
Issue Date:April 2006
pp. 588-592
It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in order to ensure a required statistical significance, represent a large number of...
     
 1