Sciweavers

387 search results - page 18 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
DCC
2000
IEEE
14 years 2 days ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
RSKT
2007
Springer
14 years 1 months ago
Mining Associations for Interface Design
Abstract. Consumer research has indicated that consumers use compensatory and non-compensatory decision strategies when formulating their purchasing decisions. Compensatory decisio...
Timothy Maciag, Daryl H. Hepting, Dominik Slezak, ...
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
11 years 10 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
EACL
2010
ACL Anthology
13 years 9 months ago
Generating Approximate Geographic Descriptions
Georeferenced data sets are often large and complex. Natural Language Generation (NLG) systems are beginning to emerge that generate texts from such data. One of the challenges th...
Ross Turner, Somayajulu Sripada, Ehud Reiter