All Stories

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