Sciweavers

449 search results - page 71 / 90
» Latent Structure Pattern Mining
Sort
View
SDM
2010
SIAM
204views Data Mining» more  SDM 2010»
13 years 8 months ago
Scalable Tensor Factorizations with Missing Data
The problem of missing data is ubiquitous in domains such as biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer...
Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda, Mo...
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 9 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 1 months ago
Usage-Based PageRank for Web Personalization
Recommendation algorithms aim at proposing “next” pages to a user based on her current visit and the past users’ navigational patterns. In the vast majority of related algor...
Magdalini Eirinaki, Michalis Vazirgiannis
DL
2000
Springer
162views Digital Library» more  DL 2000»
13 years 11 months ago
Snowball: extracting relations from large plain-text collections
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...
Eugene Agichtein, Luis Gravano
CIKM
2009
Springer
14 years 2 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan