Sciweavers

2065 search results - page 202 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
SIGIR
2003
ACM
15 years 11 months ago
Collaborative filtering via gaussian probabilistic latent semantic analysis
Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, i.e. a database of available user preferences. In this ...
Thomas Hofmann
CLUSTER
2008
IEEE
15 years 8 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
DIS
2010
Springer
15 years 5 months ago
Sentiment Knowledge Discovery in Twitter Streaming Data
Micro-blogs are a challenging new source of information for data mining techniques. Twitter is a micro-blogging service built to discover what is happening at any moment in time, a...
Albert Bifet, Eibe Frank
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
16 years 7 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren