Sciweavers

1382 search results - page 199 / 277
» Formal Analysis of Online Algorithms
Sort
View
DOLAP
2006
ACM
16 years 10 days ago
Enhanced mining of association rules from data cubes
On-line analytical processing (OLAP) provides tools to explore and navigate into data cubes in order to extract interesting information. Nevertheless, OLAP is not capable of expla...
Riadh Ben Messaoud, Sabine Loudcher Rabaséd...
WECWIS
2005
IEEE
137views ECommerce» more  WECWIS 2005»
15 years 12 months ago
Using Singular Value Decomposition Approximation for Collaborative Filtering
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
Sheng Zhang, Weihong Wang, James Ford, Fillia Make...
GIS
2009
ACM
15 years 10 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov
CIKM
2008
Springer
15 years 8 months ago
Summarization of social activity over time: people, actions and concepts in dynamic networks
We present a framework for automatically summarizing social group activity over time. The problem is important in understanding large scale online social networks, which have dive...
Yu-Ru Lin, Hari Sundaram, Aisling Kelliher
JDWM
2006
104views more  JDWM 2006»
15 years 6 months ago
Navigation Rules for Exploring Large Multidimensional Data Cubes
Navigating through multidimensional data cubes is a nontrivial task. Although On-Line Analytical Processing (OLAP) provides the capability to view multidimensional data through ro...
Navin Kumar, Aryya Gangopadhyay, George Karabatis,...