Sciweavers

124 search results - page 19 / 25
» Quantitative evaluation of approximate frequent pattern mini...
Sort
View
SEMCO
2008
IEEE
15 years 4 months ago
A Comparative Study of Feature Extraction Algorithms in Customer Reviews
The paper systematically compares two feature extraction algorithms to mine product features commented on in customer reviews. The first approach [17] identifies candidate featu...
Liliana Ferreira, Niklas Jakob, Iryna Gurevych
HPCC
2005
Springer
15 years 3 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
15 years 10 months ago
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers
Abstract. Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has bec...
Andreas Geyer-Schulz, Michael Hahsler
DIS
2004
Springer
15 years 3 months ago
Predictive Graph Mining
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
Andreas Karwath, Luc De Raedt
KDD
2005
ACM
106views Data Mining» more  KDD 2005»
15 years 10 months ago
Simultaneous optimization of complex mining tasks with a knowledgeable cache
With an increasing use of data mining tools and techniques, we envision that a Knowledge Discovery and Data Mining System (KDDMS) will have to support and optimize for the followi...
Ruoming Jin, Kaushik Sinha, Gagan Agrawal