Sciweavers

539 search results - page 97 / 108
» Finding Groups in Data: Cluster Analysis with Ants
Sort
View
KDD
2007
ACM
169views Data Mining» more  KDD 2007»
16 years 1 days ago
Exploiting underrepresented query aspects for automatic query expansion
Users attempt to express their search goals through web search queries. When a search goal has multiple components or aspects, documents that represent all the aspects are likely ...
Daniel Crabtree, Peter Andreae, Xiaoying Gao
ICML
2008
IEEE
16 years 13 days ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
16 years 1 days ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
HT
2006
ACM
15 years 5 months ago
Using string-matching to analyze hypertext navigation
A method of using string-matching to analyze hypertext navigation was developed, and evaluated using two weeks of website logfile data. The method is divided into phases that use:...
Roy A. Ruddle
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
16 years 1 days ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt