Sciweavers

588 search results - page 98 / 118
» Mining Soft-Matching Rules from Textual Data
Sort
View
DKE
2008
124views more  DKE 2008»
13 years 8 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 8 months ago
Document stream clustering: experimenting an incremental algorithm and AR-based tools for highlighting dynamic trends
We address here two major challenges presented by dynamic data mining: 1) the stability challenge: we have implemented a rigorous incremental density-based clustering algorithm, i...
Alain Lelu, Martine Cadot, Pascal Cuxac
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 6 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
CIKM
2008
Springer
13 years 10 months ago
The query-flow graph: model and applications
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 ...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, De...
CINQ
2004
Springer
116views Database» more  CINQ 2004»
14 years 13 days ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...