All Stories

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