On the public citation graph

Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks

0 signed · 71 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9780470316801openalex-snapshot
Finding Groups in Data
inferredcites →https://doi.org/10.1007/11564126_18openalex-snapshot
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
inferredcites →https://doi.org/10.1007/11787181_11openalex-snapshot
Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery
inferredcites →https://doi.org/10.1007/3-540-45995-2_51openalex-snapshot
Massive Quasi-Clique Detection
inferredcites →https://doi.org/10.1007/bf01414948openalex-snapshot
Self-organizing neural networks for the analysis and representation of data: Some financial cases
inferredcites →https://doi.org/10.1016/j.dam.2003.09.004openalex-snapshot
Consensus algorithms for the generation of all maximal bicliques
inferredcites →https://doi.org/10.1016/j.ympev.2005.02.008openalex-snapshot
Identifying optimal incomplete phylogenetic data sets from sequence databases
inferredcites →https://doi.org/10.1016/s0378-7206(04)00072-2openalex-snapshot
The language of quarterly reports as an indicator of change in the companyʼs financial status
inferredcites →https://doi.org/10.1023/a:1026083612746openalex-snapshot
Self-Organizing-Map Based Clustering Using a Local Clustering Validity Index
inferredcites →https://doi.org/10.1023/b:mach.0000033117.77257.41openalex-snapshot
A New Conceptual Clustering Framework
inferredcites →https://doi.org/10.1093/bioinformatics/btl020openalex-snapshot
Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale
inferredcites →https://doi.org/10.1093/bioinformatics/btn174openalex-snapshot
Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space
inferredcites →https://doi.org/10.1093/nar/gkg340openalex-snapshot
Topological structure analysis of the protein-protein interaction network in budding yeast
inferredcites →https://doi.org/10.1109/72.846731openalex-snapshot
Clustering of the self-organizing map
inferredcites →https://doi.org/10.1109/icdm.2006.111openalex-snapshot
Mining Maximal Quasi-Bicliques to Co-Cluster Stocks and Financial Ratios for Value Investment
inferredcites →https://doi.org/10.1109/ictai.2007.173openalex-snapshot
Finding Hotspots in Document Collection
inferredcites →https://doi.org/10.1109/tkde.2007.190660openalex-snapshot
Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms
inferredcites →https://doi.org/10.1109/wi.2004.10154openalex-snapshot
Discovery of User Communities from Web Audience Measurement Data
inferredcites →https://doi.org/10.1126/science.1064987openalex-snapshot
A Combined Experimental and Computational Strategy to Define Protein Interaction Networks for Peptide Recognition Modules
inferredcites →https://doi.org/10.1137/1.9781611972764.36openalex-snapshot
Mining Approximate Frequent Itemsets In the Presence of Noise: Algorithm and Analysis
inferredcites →https://doi.org/10.1137/1.9781611972788.7openalex-snapshot
Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications
inferredcites →https://doi.org/10.1145/1007730.1007731openalex-snapshot
Subspace clustering for high dimensional data
inferredcites →https://doi.org/10.1145/1081870.1081898openalex-snapshot
On mining cross-graph quasi-cliques
inferredcites →https://doi.org/10.1145/1133905.1133916openalex-snapshot
LCM ver.3
inferredcites →https://doi.org/10.1145/1401890.1401930openalex-snapshot
Quantitative evaluation of approximate frequent pattern mining algorithms
inferredcites →https://doi.org/10.1145/502512.502539openalex-snapshot
Efficient discovery of error-tolerant frequent itemsets in high dimensions
inferredcites →https://doi.org/10.1145/502512.502550openalex-snapshot
Co-clustering documents and words using bipartite spectral graph partitioning
inferredcites →https://doi.org/10.1186/gb-2007-8-9-r186openalex-snapshot
Coverage and error models of protein-protein interaction data by directed graph analysis
inferredcites →https://doi.org/10.4135/9781412973380.n22openalex-snapshot
An Introduction to Data Mining
inferredcites →https://doi.org/10.5860/choice.49-3305openalex-snapshot
Data mining: concepts and techniques

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-15070-9_8openalex-snapshot
Brain Storm Optimization Algorithms for Solving Equations Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-62696-9_8openalex-snapshot
Graph Mining Meets Fake News Detection
inferred← citeshttps://doi.org/10.1007/978-3-030-65347-7_2openalex-snapshot
Efficient Community Detection by Exploiting Structural Properties of Real-World User-Item Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-97568-5_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-030-97568-5_3openalex-snapshot
CSS on Bipartite Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-97568-5_5openalex-snapshot
Comparison Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-21260-4_40openalex-snapshot
Mining Biological Interaction Networks Using Weighted Quasi-Bicliques
inferred← citeshttps://doi.org/10.1007/978-3-642-40988-2_33openalex-snapshot
Detecting Bicliques in GF[q]
inferred← citeshttps://doi.org/10.1007/978-981-95-3906-2_7openalex-snapshot
Efficient Maximum $$(\alpha ,\beta )$$-Quasi Biclique Computation on Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00778-021-00658-5openalex-snapshot
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-024-00882-9openalex-snapshot
Accelerating maximum biplex search over large bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00939-3openalex-snapshot
Efficient maximum signed biclique and biplex identification in signed bipartite graphs
inferred← citeshttps://doi.org/10.1007/s10618-012-0258-xopenalex-snapshot
A survey on enhanced subspace clustering
inferred← citeshttps://doi.org/10.1007/s11227-024-06733-2openalex-snapshot
Improved binary linear programming models for finding maximum edge Bi-clique in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2013.07.094openalex-snapshot
Sliding window based weighted maximal frequent pattern mining over data streams
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.01.049openalex-snapshot
Incremental mining of weighted maximal frequent itemsets from dynamic databases
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.128380openalex-snapshot
Efficient top- k s -biplexes search over large bipartite graphs with time complexity guarantees
inferred← citeshttps://doi.org/10.1016/j.ins.2010.08.035openalex-snapshot
A case study on financial ratios via cross-graph quasi-bicliques
inferred← citeshttps://doi.org/10.1016/j.ins.2025.122758openalex-snapshot
Dense subgraph mining in dynamic bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.knosys.2013.10.011openalex-snapshot
Mining maximal frequent patterns by considering weight conditions over data streams
inferred← citeshttps://doi.org/10.1016/j.physa.2020.124219openalex-snapshot
A mixed solution-based high agreement filtering method for class noise detection in binary classification
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00063openalex-snapshot
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00072openalex-snapshot
Maximum Biplex Search over Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00118openalex-snapshot
On Efficient Large Maximal Biplex Discovery (Extended abstract)
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00188openalex-snapshot
Maximal Directed Quasi -Clique Mining
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00405openalex-snapshot
Bipartite Graph Analytics: Current Techniques and Future Trends
inferred← citeshttps://doi.org/10.1109/tkde.2021.3077071openalex-snapshot
On Efficient Large Maximal Biplex Discovery
inferred← citeshttps://doi.org/10.1142/s0218001416500129openalex-snapshot
Approximate Maximal Frequent Pattern Mining with Weight Conditions and Error Tolerance
inferred← citeshttps://doi.org/10.1142/s0218488517500052openalex-snapshot
Mining Frequent Weighted Itemsets without Storing Transaction IDs and Generating Candidates
inferred← citeshttps://doi.org/10.1142/s179383092550123xopenalex-snapshot
A new integer linear programming formulation for the maximum balanced Bi-clique problem
inferred← citeshttps://doi.org/10.1145/3709680openalex-snapshot
Density Decomposition of Bipartite Graphs
inferred← citeshttps://doi.org/10.1155/2022/7430106openalex-snapshot
LCTree-Based Approach for Mining Frequent Items in Real-Time
inferred← citeshttps://doi.org/10.1186/1471-2105-13-322openalex-snapshot
Finding quasi-modules of human and viral miRNAs: a case study of human cytomegalovirus (HCMV)
inferred← citeshttps://doi.org/10.1186/1471-2105-13-s10-s16openalex-snapshot
Exploring biological interaction networks with tailored weighted quasi-bicliques
inferred← citeshttps://doi.org/10.1609/aaai.v35i17.17781openalex-snapshot
Using Unsupervised Learning for Data-driven Procurement Demand Aggregation
inferred← citeshttps://doi.org/10.26599/tst.2024.9010009openalex-snapshot
Efficient Maximum Vertex (k,ℓ)-Biplex Computation on Bipartite Graphs
inferred← citeshttps://doi.org/10.32657/10356/171775openalex-snapshot
Cohesive subgraph mining in large graphs
inferred← citeshttps://doi.org/10.3390/math14081298openalex-snapshot
Split-and-Reduce: A New Exact Algorithm with Tight Multi-Order Intersection Bounds for the Quasi-Clique Enumeration Problem
inferred← citeshttps://doi.org/10.4137/cin.s39369openalex-snapshot
Discovering MicroRNA-Regulatory Modules in Multi-Dimensional Cancer Genomic Data: A Survey of Computational Methods
inferred← citeshttps://doi.org/10.70675/47edfa88zc205z49f5z8fbdz2a2670210628openalex-snapshot
Co-evolution pattern mining in dynamic attributed graphs
inferred← citeshttps://doi.org/10.70675/9778aca1z6601z4723za496z164c85caa7f9openalex-snapshot
Subspace clustering on static datasets and dynamic data streams using bio-inspired algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.