Sciweavers

1693 search results - page 168 / 339
» Pattern-Recognition: a Foundational Approach
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 5 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
KDD
2007
ACM
170views Data Mining» more  KDD 2007»
16 years 5 months ago
From frequent itemsets to semantically meaningful visual patterns
Data mining techniques that are successful in transaction and text data may not be simply applied to image data that contain high-dimensional features and have spatial structures....
Junsong Yuan, Ying Wu, Ming Yang
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
16 years 5 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 5 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 5 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....