On the public citation graph

Discovering the Most Influential Sites over Uncertain Data: A Rank-Based Approach

0 signed · 52 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/11733836_22openalex-snapshot
Probabilistic Similarity Join on Uncertain Data
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-540-71703-4_30openalex-snapshot
Probabilistic Nearest-Neighbor Query on Uncertain Objects
inferredcites →https://doi.org/10.1007/s00778-008-0123-0openalex-snapshot
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
inferredcites →https://doi.org/10.1016/b978-012088469-8.50066-8openalex-snapshot
kReverse NN Search in Arbitrary Dimensionality
inferredcites →https://doi.org/10.1016/b978-012088469-8.50077-2openalex-snapshot
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/icde.2001.914862openalex-snapshot
An index structure for efficient reverse nearest neighbor queries
inferredcites →https://doi.org/10.1109/icde.2007.367904openalex-snapshot
Efficient Evaluation of Imprecise Location-Dependent Queries
inferredcites →https://doi.org/10.1109/icde.2007.367926openalex-snapshot
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors
inferredcites →https://doi.org/10.1109/icde.2007.367934openalex-snapshot
Efficient Top-k Query Evaluation on Probabilistic Data
inferredcites →https://doi.org/10.1109/icde.2007.367935openalex-snapshot
Top-k Query Processing in Uncertain Databases
inferredcites →https://doi.org/10.1109/icde.2008.4497465openalex-snapshot
Top-k Spatial Joins of Probabilistic Objects
inferredcites →https://doi.org/10.1109/icde.2008.4497506openalex-snapshot
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
inferredcites →https://doi.org/10.1109/icde.2009.75openalex-snapshot
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
inferredcites →https://doi.org/10.1109/icde.2010.5447874openalex-snapshot
Efficient rank based KNN query processing over uncertain data
inferredcites →https://doi.org/10.1109/icdew.2008.4498380openalex-snapshot
On the semantics and evaluation of top-k queries in probabilistic databases
inferredcites →https://doi.org/10.1109/tkde.2006.148openalex-snapshot
Reverse Nearest Neighbor Search in Metric Spaces
inferredcites →https://doi.org/10.1109/tkde.2008.41openalex-snapshot
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
inferredcites →https://doi.org/10.1109/tkde.2008.90openalex-snapshot
Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations
inferredcites →https://doi.org/10.1145/1376616.1376641openalex-snapshot
Monochromatic and bichromatic reverse skyline search over uncertain databases
inferredcites →https://doi.org/10.1145/1376616.1376685openalex-snapshot
Ranking queries on uncertain data
inferredcites →https://doi.org/10.1145/1516360.1516438openalex-snapshot
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
inferredcites →https://doi.org/10.1145/1559845.1559886openalex-snapshot
Top- k queries on uncertain data
inferredcites →https://doi.org/10.1145/335191.335415openalex-snapshot
Influence sets based on reverse nearest neighbor queries
inferredcites →https://doi.org/10.1145/872757.872823openalex-snapshot
Evaluating probabilistic queries over imprecise data
inferredcites →https://doi.org/10.14778/1687627.1687685openalex-snapshot
A unified approach to ranking in probabilistic databases

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-319-32049-6_10openalex-snapshot
On Efficient Spatial Keyword Querying with Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-32049-6_21openalex-snapshot
An Efficient Location-Aware Top-k Subscription Matching for Publish/Subscribe with Boolean Expressions
inferred← citeshttps://doi.org/10.1007/978-3-319-55699-4_3openalex-snapshot
Multi-objective Spatial Keyword Query with Semantics
inferred← citeshttps://doi.org/10.1007/s00607-013-0382-5openalex-snapshot
MapReduce based location selection algorithm for utility maximization with capacity constraints
inferred← citeshttps://doi.org/10.1007/s10115-013-0720-0openalex-snapshot
Analysis and evaluation of the top- $$k$$ k most influential location selection query
inferred← citeshttps://doi.org/10.1007/s10619-020-07283-1openalex-snapshot
Multi-objective spatial keyword query with semantics: a distance-owner based approach
inferred← citeshttps://doi.org/10.1007/s10707-017-0303-4openalex-snapshot
EPLA: efficient personal location anonymity
inferred← citeshttps://doi.org/10.1007/s10707-018-0318-5openalex-snapshot
k-most suitable locations selection
inferred← citeshttps://doi.org/10.1007/s11042-016-4220-6openalex-snapshot
A health management tool based smart phone
inferred← citeshttps://doi.org/10.1007/s11704-017-6472-3openalex-snapshot
Improved expert selection model for forex trading
inferred← citeshttps://doi.org/10.1007/s41019-021-00157-1openalex-snapshot
Top-k Competitive Location Selection over Moving Objects
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.08.051openalex-snapshot
Capacity constrained maximizing bichromatic reverse nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.06.050openalex-snapshot
Modeling uncertain data using Monte Carlo integration method for clustering
inferred← citeshttps://doi.org/10.1093/comjnl/bxab139openalex-snapshot
Minimal Rare Pattern-Based Outlier Detection Approach For Uncertain Data Streams Under Monotonic Constraints
inferred← citeshttps://doi.org/10.1109/access.2018.2805831openalex-snapshot
Learning Individual Moving Preference and Social Interaction for Location Prediction
inferred← citeshttps://doi.org/10.1109/access.2021.3083969openalex-snapshot
Clustering Uncertain Data Objects Using Jeffreys-Divergence and Maximum Bipartite Matching Based Similarity Measure
inferred← citeshttps://doi.org/10.1109/tkde.2013.2297916openalex-snapshot
Data Acquisition for Probabilistic Nearest-Neighbor Query
inferred← citeshttps://doi.org/10.1109/tkde.2015.2457899openalex-snapshot
Finding Top $k$ Most Influential Spatial Facilities over Uncertain Objects
inferred← citeshttps://doi.org/10.1109/tkde.2016.2580138openalex-snapshot
PINOCCHIO: Probabilistic Influence-Based Location Selection over Moving Objects
inferred← citeshttps://doi.org/10.1145/2396761.2396878openalex-snapshot
Finding top k most influential spatial facilities over uncertain objects
inferred← citeshttps://doi.org/10.4018/978-1-7998-9220-5.ch134openalex-snapshot
Structure Implementation of Online Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4900openalex-snapshot
Query Interface Integrator For Domain Specific Hidden Web
inferred← citeshttps://doi.org/10.52458/9789391842130.2022.ch2.eb.asuopenalex-snapshot
LEAST COST TECHNIQUES FOR HIDDEN WEB
inferred← citeshttps://doi.org/10.52458/9789391842505.2022.ch2.eb.asuopenalex-snapshot
PEDAGOGICAL AND TECHNICAL DIMENSIONS IN SCRIPTS FOR INSTRUCTIONAL RADIO
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.