All Stories

  1. 25th International Workshop on Data Mining in Bioinformatics (BIOKDD 2026)
  2. Semantic Graph Based Learning for Trend Prediction from Long Financial Documents
  3. 24 th International Workshop on Data Mining in Bioinformatics (BIOKDD 2025)
  4. LLaVA-Chef: A Multi-modal Generative Model for Food Recipes
  5. 23 rd International Workshop on Data Mining in Bioinformatics (BIOKDD 2024)
  6. FETILDA: An Evaluation Framework for Effective Representations of Long Financial Documents
  7. Toward Subgraph-Guided Knowledge Graph Question Generation With Graph Neural Networks
  8. 22nd International Workshop on Data Mining in Bioinformatics (BIOKDD 2023)
  9. The Information Pathways Hypothesis: Transformers are Dynamic Self-Ensembles
  10. Health-guided recipe recommendation over knowledge graphs
  11. Domain-Specific Keyword Extraction Using Joint Modeling of Local and Global Contextual Semantics
  12. 21th International Workshop on Data Mining in Bioinformatics (BIOKDD 2022)
  13. Global Self-Attention as a Replacement for Graph Convolution
  14. 20th International Workshop on Data Mining in Bioinformatics (BIOKDD 2021)
  15. A Framework for Generating Summaries from Temporal Personal Health Data
  16. Personalized Food Recommendation as Constrained Question Answering over a Large-scale Food Knowledge Graph
  17. A Comparative Analysis of Temporal Long Text Similarity: Application to Financial Documents
  18. An Efficient Heartbeats Classifier Based on Optimizing Convolutional Neural Network Model
  19. RECIPTOR: An Effective Pretrained Model for Recipe Representation Learning
  20. Figurative language in social media
  21. MALOnt: An Ontology for Malware Threat Intelligence
  22. FoodKG: A Semantics-Driven Knowledge Graph for Food Recommendation
  23. KATE
  24. Graph Data Mining with Arabesque
  25. Rheem
  26. A distributed approach for graph mining in massive networks
  27. Sampling frequent and minimal boolean patterns: theory and application in classification
  28. Learning sequential classifiers from long and noisy discrete-event sequences efficiently
  29. NSIT: Novel Sequence Identification Tool
  30. Trends in computer science research
  31. Approximate graph mining with label costs
  32. ProfileRank
  33. Stochastic subspace search for top-k multi-view clustering
  34. Message from Program Co-chairs
  35. Sampling minimal frequent boolean (DNF) patterns
  36. Graph mining for discovering infrastructure patterns in configuration management databases
  37. Effective graph classification based on topological and label attributes
  38. Characterizing the effectiveness of twitter hashtags to detect and track online population sentiment
  39. A Journey in Pattern Mining
  40. Geofold: Topology-based protein unfolding pathways capture the effects of engineered disulfides on kinetic stability
  41. Infrastructure Pattern Discovery in Configuration Management Databases via Large Sparse Graph Mining
  42. Preface
  43. GRAIL: a scalable index for reachability queries in very large graphs
  44. Calibrated lazy associative classification
  45. Is There a Best Quality Metric for Graph Clusters?
  46. Mining Complex Boolean Expressions for Sequential Equivalence Checking
  47. SimClus: an effective algorithm for clustering with a lower bound on similarity
  48. Structural correlation pattern mining for large graphs
  49. Matrix "Bit" loaded
  50. Prism: An effective approach for frequent sequence mining via prime-block encoding
  51. FlexSnap: Flexible Non-sequential Protein Structure Alignment
  52. Graph indexing for reachability queries
  53. VOGUE
  54. Competence‐conscious associative classification
  55. Proteomic and Phospho-Proteomic Profile of Human Platelets in Basal, Resting State: Insights into Integrin Signaling
  56. Robust partitional clustering by outlier and density insensitive seeding
  57. SPARCL: an effective and efficient algorithm for mining arbitrary shape-based clusters
  58. Clustering with Lower Bound on Similarity
  59. FlexSnap: Flexible Non-sequential Protein Structure Alignment
  60. graphOnt: An ontology based library for conversion from semantic graphs to JUNG
  61. Quantification of Spatial Parameters in 3D Cellular Constructs Using Graph Theory
  62. SPARCL: Efficient and Effective Shape-Based Clustering
  63. An integrated, generic approach to pattern mining: data mining template library
  64. ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
  65. Introduction to special issue on bioinformatics
  66. The ParTriCluster Algorithm for Gene Expression Analysis
  67. Context shapes: Efficient complementary shape matching for protein–protein docking
  68. PSIST: A scalable approach to indexing protein structures using suffix trees
  69. ORIGAMI: Mining Representative Orthogonal Graph Patterns
  70. Prism: A Primal-Encoding Approach for Frequent Sequence Mining
  71. Xproj
  72. Genome-scale disk-based suffix tree indexing
  73. T ri C luster: Mining Coherent Clusters in Three‐Dimensional Microarray Data
  74. Data Mining in Bioinformatics (BIOKDD)
  75. Clicks: An effective algorithm for mining subspace clusters in categorical datasets
  76. Exploring Similarities Across High-Dimensional Datasets
  77. Lazy Associative Classification
  78. SMOTIF: efficient structured pattern and profile motif search
  79. EXMOTIF: efficient structured motif extraction
  80. Unified Approach to Rooted Tree Mining: Algorithms and Applications
  81. Mining Multiple Data Sources: Local Pattern Analysis
  82. XRules: An effective algorithm for structural classification of XML data
  83. Finding Hidden Group Structure in a Stream of Communications
  84. Generic Pattern Mining Via Data Mining Template Library
  85. Multi-evidence, multi-criteria, lazy associative document classification
  86. CLICKS
  87. Reasoning about sets using redescription mining
  88. The Complexity of Finding Top-Toda-Equivalence-Class Members
  89. Efficiently mining frequent trees in a forest: algorithms and applications
  90. GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets
  91. Efficient algorithms for mining closed itemsets and their lattice structure
  92. A facile approach to formation of through-hole porous anodic aluminum oxide film
  93. PSIST: indexing protein structures using suffix trees
  94. SCHISM: a new approach to interesting subspace mining
  95. Towards Generic Pattern Mining
  96. Mining Non-Redundant Association Rules
  97. Predicting protein folding pathways
  98. Mining residue contacts in proteins using local structure predictions
  99. Carpenter
  100. Fast vertical mining using diffsets
  101. Improving spatial locality of programs via data mining
  102. XRules
  103. Special issue on data management in bioinformatics
  104. Parallel Sequence Mining on Shared-Memory Machines
  105. Scalable algorithms for association mining
  106. Parallel and distributed association mining: a survey
  107. Customized Dynamic Load Balancing for a Network of Workstations
  108. CLICKS: Mining Subspace Clusters in Categorical Data via K-Partite Maximal Cliques
  109. SCHISM: A New Approach for Interesting Subspace Mining