Sciweavers

1301 search results - page 233 / 261
» Default Clustering from Sparse Data Sets
Sort
View
ICDE
2008
IEEE
126views Database» more  ICDE 2008»
14 years 2 months ago
Monitoring the evolution of interests in the blogosphere
— We describe blogTrust, an innovative modular and extensible prototype application for monitoring changes in the interests of blogosphere participants. We also propose a new app...
Iraklis Varlamis, Vasilis Vassalos, Antonis Palaio...
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
14 years 2 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 25 days ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
13 years 11 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut

Publication
372views
14 years 8 months ago
Multi-Objects Interpretation
We describe a general-purpose method for the accurate and robust interpretation of a data set of p-dimensional points by several deformable prototypes. This method is based on the ...
Jean-Philippe Tarel