On the public citation graph

Distributed Web Log Mining Using Maximal Large Itemsets

0 signed · 19 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.1007/bf03325089openalex-snapshot

Data Preparation for Mining World Wide Web Browsing Patterns

inferredcites →https://doi.org/10.1007/pl00011677openalex-snapshot

Distributed Clustering Using Collective Principal Component Analysis

inferredcites →https://doi.org/10.1016/0169-7552(94)90129-5openalex-snapshot

A scalable HTTP server: The NCSA prototype

inferredcites →https://doi.org/10.1080/00401706.1990.10484648openalex-snapshot

Algorithms for Clustering Data

inferredcites →https://doi.org/10.1109/adl.1998.670376openalex-snapshot

Discovering Web access patterns and trends by applying OLAP and data mining technology on Web logs

inferredcites →https://doi.org/10.1109/icde.1999.754967openalex-snapshot

ROCK: a robust clustering algorithm for categorical attributes

inferredcites →https://doi.org/10.1109/kdex.1999.836525openalex-snapshot

Creating adaptive Web sites through usage-based clustering of URLs

inferredcites →https://doi.org/10.1145/3857.3861openalex-snapshot

Adaptive record clustering

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10115-006-0039-1openalex-snapshot

Summarization – compressing data into an informative representation

inferred← citeshttps://doi.org/10.1007/s10115-008-0127-5openalex-snapshot

Multirelational classification: a multiple view approach

inferred← citeshttps://doi.org/10.1007/s10115-008-0179-6openalex-snapshot

PADS: a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining

inferred← citeshttps://doi.org/10.1007/s10115-009-0274-3openalex-snapshot

A local asynchronous distributed privacy preserving feature selection algorithm for large peer-to-peer networks

inferred← citeshttps://doi.org/10.1007/s12046-019-1158-1openalex-snapshot

An efficient approach based on selective partitioning for maximal frequent itemsets mining

inferred← citeshttps://doi.org/10.1109/icmlc.2005.1527326openalex-snapshot

Parallel Web mining for link prediction in cluster server

inferred← citeshttps://doi.org/10.1109/icosp.2004.1441614openalex-snapshot

The applications of generalized learning in RSIRS

inferred← citeshttps://doi.org/10.1109/tkde.2003.1185839openalex-snapshot

Synthesizing high-frequency rules from different data sources

inferred← citeshttps://doi.org/10.1524/9783486594959.767openalex-snapshot

inferred← citeshttps://doi.org/10.4018/978-1-60960-497-4.ch018openalex-snapshot

Enhancing Service Quality in Hospitals

inferred← citeshttps://doi.org/10.4018/jicthd.2009091505openalex-snapshot

Enhancing Service Quality in Hospitals

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.