All Stories

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