Sciweavers

2783 search results - page 486 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 1 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
KDD
2007
ACM
160views Data Mining» more  KDD 2007»
16 years 1 months ago
Show me the money!: deriving the pricing power of product features by mining consumer reviews
The increasing pervasiveness of the Internet has dramatically changed the way that consumers shop for goods. Consumergenerated product reviews have become a valuable source of inf...
Nikolay Archak, Anindya Ghose, Panagiotis G. Ipeir...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 1 months ago
Local decomposition for rare class analysis
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
Junjie Wu, Hui Xiong, Peng Wu, Jian Chen
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 1 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
16 years 1 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila