Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Algorithms for clustering data
Algorithms for clustering data
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for geometric problems
Approximation algorithms for NP-hard problems
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data Mining: An Overview from a Database Perspective
IEEE Transactions on Knowledge and Data Engineering
What Makes Patterns Interesting in Knowledge Discovery Systems
IEEE Transactions on Knowledge and Data Engineering
Post-analysis of learned rules
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Clustering in large graphs and matrices
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The 2-catalog segmentation problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
Competitive recommendation systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Microeconomic View of Data Mining
Data Mining and Knowledge Discovery
Image Segmentation with Monotonicity and Smoothness Constraints
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the Hardness of Finding Optimal Multiple Preset Dictionaries
DCC '01 Proceedings of the Data Compression Conference
A New Conceptual Clustering Framework
Machine Learning
A microeconomic data mining problem: customer-oriented catalog segmentation
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering via matrix powering
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Contextual recommender problems [extended abstract]
UBDM '05 Proceedings of the 1st international workshop on Utility-based data mining
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
DADA: a data cube for dominant relationship analysis
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Customer-oriented catalog segmentation: effective solution approaches
Decision Support Systems
High-utility pattern mining: A method for discovery of high-utility item sets
Pattern Recognition
On dominating your neighborhood profitably
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On space constrained set selection problems
Data & Knowledge Engineering
On domination game analysis for microeconomic data mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
Catalog segmentation with double constraints in business
Pattern Recognition Letters
Efficient layered density-based clustering of categorical data
Journal of Biomedical Informatics
Hierarchical density-based clustering of categorical data and a simplification
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Universal ε-approximators for integrals
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of several haplotyping problems
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
On approximation algorithms for data mining applications
Efficient Approximation and Online Algorithms
Haplotype inference via hierarchical genotype parsing
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Minimum mosaic inference of a set of recombinants
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Minimum mosaic inference of a set of recombinants
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Journal of Combinatorial Optimization
| Hi-index | 0.00 |