Sciweavers

732 search results - page 128 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
CEAS
2008
Springer
13 years 9 months ago
A Campaign-based Characterization of Spamming Strategies
This paper presents a methodology for the characterization of spamming strategies based on the identification of spam campaigns. To deeply understand how spammers abuse network re...
Pedro Calais, Douglas Pires, Dorgival Olavo Guedes...
COMPGEOM
2008
ACM
13 years 9 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
CLEIEJ
2004
168views more  CLEIEJ 2004»
13 years 7 months ago
Contributions of KDD to the Knowledge Management Process: a Case Study
Knowledge Discovery in Databases (KDD), as any organizational process, is carried out beneath a Knowledge Management (KM) model adopted (even informally) by a corporation. KDD is ...
Paulo de Tarso Costa de Sousa, Hércules Ant...
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
14 years 8 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
14 years 8 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye