Sciweavers

14774 search results - page 2818 / 2955
» Computational complexity and evolutionary computation
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 5 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2007
ACM
211views Data Mining» more  KDD 2007»
16 years 5 months ago
Enhanced max margin learning on multimodal data mining in a multimedia database
The problem of multimodal data mining in a multimedia database can be addressed as a structured prediction problem where we learn the mapping from an input to the structured and i...
Zhen Guo, Zhongfei Zhang, Eric P. Xing, Christos F...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 5 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 5 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 5 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
« Prev « First page 2818 / 2955 Last » Next »