Results 51 to 60 of about 1,381,457 (160)
Mining Top-K Frequent Itemsets Through Progressive Sampling
, 2010 We study the use of sampling for efficiently mining the top-K frequent itemsets of cardinality at most w. To this purpose, we define an approximation to the top-K frequent itemsets to be a family of itemsets which includes (resp., excludes) all very ...
Andrea Pietracaprina +8 more
core +1 more source
Efficient top-k string similarity query algorithms
Tongxin xuebao, 2014 Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to ...
Zi-yang CHEN +3 more
doaj +2 more sources
An Energy-Efficient Sequence-Aware Top- Monitoring Scheme in Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2013 We focus on top- k monitoring in wireless sensor networks and propose a novel sequence-aware top- k monitoring algorithm called SAT. Top- k monitoring is important to many applications of sensor networks. Conventional top- k monitoring algorithms install
Myungho Yeo +4 more
doaj +1 more source
Stochastic Top-k ListNet [PDF]
Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015 ListNet is a well-known listwise learning to rank model and has gained much attention in recent years. A particular problem of ListNet, however, is the high computation complexity in model training, mainly due to the large number of object permutations involved in computing the gradients. This paper proposes a stochastic ListNet approach which computes
Luo, Tianyi +3 more
openaire +2 more sources
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation [PDF]
, 2010 We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and name disambiguation. In particular, we apply
Danil Nemirovsky +5 more
core +8 more sources
T${}^2$K${}^2$: The Twitter Top-K Keywords Benchmark
, 2017 Information retrieval from textual data focuses on the construction of vocabularies that contain weighted term tuples. Such vocabularies can then be exploited by various text analysis algorithms to extract new knowledge, e.g., top-k keywords, top-k ...
A Guille +14 more
core +2 more sources
P4KP: QoS-Aware Top-K Best Path Using Programmable Switch
IEEE Access, 2021 Data center networks offer multiple parallel paths between a source-destination pair. But, due to the use of TCAM based single logical step ‘path-search and selection’ mechanism in the switches, most of the existing packet forwarding ...
Debobroto Das Robin, Javed I. Khan
doaj +1 more source
Differentiable Ranking Metric Using Relaxed Sorting for Top-K Recommendation
IEEE Access, 2021 Most recommenders generate recommendations for a user by computing the preference score of items, sorting the items according to the score, and filtering top- $K$ -items of high scores.
Hyunsung Lee +4 more
doaj +1 more source
Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives
, 2016 We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely characterized as the
Faliszewski, Piotr +3 more
core +1 more source
Continuous Top-k Contour Regions Querying in Sensor Networks
International Journal of Distributed Sensor Networks, 2013 Wireless sensor networks (WSNs) are important parts of Internet of Things or Cyber-Physical Systems (CPS). WSNs can be seen as a new type of distributed database systems. The data query processing is very important for WSNs.
Shangfeng Mo +4 more
doaj +1 more source