All Stories

  1. Anonymizing Periodical Releases of SRS Data by Fusing Differential Privacy
  2. Privacy-Preserving Anonymity for Periodical Releases of Spontaneous Adverse Drug Event Reporting Data: Algorithm Development and Validation
  3. Privacy-Preserving Anonymity for Periodical Releases of Spontaneous Adverse Drug Event Reporting Data: Algorithm Development and Validation (Preprint)
  4. Embracing Differential Privacy for Anonymizing Spontaneous ADE Reporting Data
  5. Deep learning from spontaneous reporting systems data to detect ADR signals
  6. Our new paper on mining indirect association rules from stream data in Intelligent Data Analysis.
  7. Privacy preserving data anonymization of spontaneous ADE reporting system dataset
  8. Rough-set-based ADR signaling from spontaneous reporting data with missing values
  9. Privacy Preserving Data Anonymization of Spontaneous ADE Reporting System Dataset
  10. Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases
  11. Rough-Set-Based ADR Signaling from Spontaneous Reporting Data with Missing Values
  12. Efficient updating of sequential patterns with transaction insertion
  13. A GA-Based Approach to Hide Sensitive High Utility Itemsets
  14. On privacy-preserving publishing of spontaneous ADE reporting data
  15. Incrementally mining high utility patterns based on pre-large concept
  16. iADRs: towards online adverse drug reaction analysis
  17. Updating generalized association rules with evolving fuzzy taxonomies
  18. Toward intelligent data warehouse mining: An ontology-integrated approach for multi-dimensional association mining
  19. Updating generalized association rules with evolving fuzzy taxonomies
  20. MCFPTree: An FP-tree-based algorithm for multi-constraint patterns discovery
  21. Favorable support threshold recommendation for multidimensional association mining using user preference ontology
  22. MCFPTree: A FP-Tree-Based Algorithm for Multi-Constrained Patterns Discovery
  23. A practical extension of web usage mining with intentional browsing data toward usage
  24. Facilitating Active Multidimensional Association Mining with User Preference Ontology
  25. Mining Generalized Association Rules in an Evolving Environment
  26. An Incremental FUSP-Tree Maintenance Algorithm
  27. Ontology-Assisted Query Formulation in Multidimensional Association Rule Mining
  28. Updating generalized association rules with evolving taxonomies
  29. Incremental maintenance of generalized association rules under taxonomy evolution
  30. Efficient mining of generalized association rules with non-uniform minimum support
  31. Dynamically Adjusting Migration Rates for Multi-Population Genetic Algorithms
  32. Incremental Maintenance of Generalized Multi-supported Association Rules under Transaction Update and Taxonomy Evolution
  33. Automated support specification for efficient mining of interesting association rules
  34. Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms
  35. Mining association rules with multiple minimum supports using maximum constraints
  36. Efficient Remining of Generalized Association Rules Under Multiple Minimum Support Refinement
  37. On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
  38. Maintenance of Generalized Association Rules Under Transaction Update and Taxonomy Evolution
  39. Maintenance of generalized association rules with multiple minimum supports
  40. OLAM Cube Selection in On-Line Multidimensional Association Rules Mining System
  41. Mining Fuzzy Association Rules with Multiple Minimum Supports Using Maximum Constraints
  42. A Genetic Selection Algorithm for OLAP Data Cubes
  43. Applying genetic algorithms to game search trees
  44. Adversarial Search by Evolutionary Computation
  45. Mining Generalized Association Rules with Multiple Minimum Supports
  46. Three Maintenance Algorithms for Compressed Object-Oriented Data Warehousing
  47. On evaluating elimination tree based parallel sparse cholesky factorizations
  48. Minimum communication cost reordering for parallel sparse Cholesky factorization
  49. Minimum Completion Time Criterion for Parallel Sparse Cholesky Factorization
  50. VECTORIZATION OF SORTING ALGORITHMS
  51. Self-adaptive multi-population GAs
  52. On optimal fill-preserving orderings of sparse matrices for parallel Cholesky factorizations
  53. On evaluating parallel sparse Cholesky factorizations
  54. A composite data model in object-oriented data warehousing
  55. Using the compressed data model in object-oriented data warehousing