Results 31 to 40 of about 9,334,973 (302)
Missing values imputation using Fuzzy K-Top Matching Value
Missing data occurs when variables or observations are missing. Researchers exclude or impute influenced variables and data. This study proposes Fuzzy K-Top Matching Value (FKTM) for missing value imputation.
Azza Ali +3 more
doaj +1 more source
Efficient Top-k Graph Similarity Search With GED Constraints
It is essential to identify similarity between graphs for various tasks in data mining, machine learning and pattern recognition. Graph edit distance (GED) is the most popular graph similarity measure thanks to its flexibility and versatility.
Jongik Kim
doaj +1 more source
Top-k Average Utility Co-location Pattern Mining of Fuzzy Features [PDF]
The spatial co-location pattern refers to a subset of non-empty spatial features whose instances are frequently located together in a spatial neighborhood.
LI Jinhong, WANG Lizhen, ZHOU Lihua
doaj +1 more source
Distributed top-k monitoring [PDF]
The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumentation, telecommunications, and others. Many of these applications involve monitoring answers to continuous queries over data streams produced at physically distributed ...
Brian Babcock, Chris Olston
openaire +1 more source
Efficient and Secure Top-k Queries With Top Order-Preserving Encryption
Top-k queries can retrieve the most relevant tuples from massive datasets and have wide implementations, such as PageRank, healthcare analytics, and decision making.
Hanyu Quan +3 more
doaj +1 more source
Real-time recommendation algorithms for crowdsourcing systems
Crowdsourcing has become a promising paradigm for solving tasks that are beyond the capabilities of machines alone via outsourcing tasks to online crowds of people.
Mejdl Safran, Dunren Che
doaj +1 more source
Top-k Distance Queries on Large Time-Evolving Graphs
Fast extraction of top- $k$ distances from graph data is a primitive of paramount importance in the fields of data mining, network analytics and machine learning, where ranked distances are exploited for several purposes (e.g., link prediction or ...
Andrea D'ascenzo, Mattia D'emidio
doaj +1 more source
We consider the sorted top-$k$ problem whose goal is to recover the top-$k$ items with the correct order out of $n$ items using pairwise comparisons. In many applications, multiple rounds of interaction can be costly. We restrict our attention to algorithms with a constant number of rounds $r$ and try to minimize the sample complexity, i.e.
Mark Braverman, Jieming Mao, Yuval Peres
openaire +3 more sources
Top-k trending topics for different values of α.
Top-k trending topics for different values of α.
Tanjim Taharat Aurpa (11250554) +2 more
core +1 more source
The objective of top-k planning is to determine a set of k different plans with lowest cost for a given planning task. In practice, such a set of best plans can be preferred to a single best plan generated by ordinary optimal planners, as it allows the user to choose between different alternatives and thus take into account preferences that may be ...
David Speck 0001 +2 more
openaire +2 more sources

