Sciweavers

318 search results - page 52 / 64
» Efficient Mining of Generalized Negative Association Rules
Sort
View
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 8 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
JIIS
2000
111views more  JIIS 2000»
13 years 7 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
ISMIS
2005
Springer
14 years 1 months ago
Model-Based Cluster Analysis for Web Users Sessions
One of the main issues inWeb usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of users’sessions and di...
George Pallis, Lefteris Angelis, Athena Vakali
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
SAC
2002
ACM
13 years 7 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...