Sciweavers

244 search results - page 43 / 49
» Generalized penetration depth computation
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 7 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...
IMC
2009
ACM
14 years 1 months ago
Network level footprints of facebook applications
With over half a billion users, Online Social Networks (OSNs) are the major new applications on the Internet. Little information is available on the network impact of OSNs, althou...
Atif Nazir, Saqib Raza, Dhruv Gupta, Chen-Nee Chua...
COLT
1993
Springer
13 years 11 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
CIKM
2006
Springer
13 years 11 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann