Sciweavers

6581 search results - page 283 / 1317
» Formalizing Design Patterns
Sort
View
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
15 years 9 months ago
On Computing Condensed Frequent Pattern Bases
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
CIKM
2011
Springer
14 years 4 months ago
Estimating selectivity for joined RDF triple patterns
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
Hai Huang 0003, Chengfei Liu
WWW
2008
ACM
15 years 4 months ago
Discovering co-located queries in geographic search logs
A geographic search request contains a query consisting of one or more keywords, and a search-location that the user searches for. In this paper, we study the problem of discoveri...
Xiangye Xiao, Longhao Wang, Xing Xie, Qiong Luo
IEEEARES
2006
IEEE
15 years 10 months ago
Feasibility of Multi-Protocol Attacks
Formal modeling and verification of security protocols typically assumes that a protocol is executed in isolation, without other protocols sharing the network. We investigate the...
Cas J. F. Cremers
ESANN
2007
15 years 5 months ago
Collaborative Filtering with interlaced Generalized Linear Models
Collaborative Filtering (CF) aims at finding patterns in a sparse matrix of contingency. It can be used for example to mine the ratings given by users on a set of items. In this p...
Nicolas Delannay, Michel Verleysen