Results 261 to 270 of about 9,334,973 (302)
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 2010 Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries have been mainly studied from the perspective of the user, focusing primarily on efficient query processing.
Akrivi Vlachou +3 more
openaire +2 more sources
Top-k Hierarchical Classification
Proceedings of the AAAI Conference on Artificial Intelligence, 2017 This paper studies a top-k hierarchical classification problem. In top-k classification, one is allowed to make k predictions and no penalty is incurred if at least one of k predictions is correct. In hierarchical classification, classes form a structured hierarchy, and misclassification costs depend on the relation between the correct ...
Oh, Sechan
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010), 2010
In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether different services are to be invoked in parallel or in a sequence. In the latter case, we may have a configuration, called pipe join, in which the output of a service is used as input for ...
MARTINENGHI, DAVIDE, TAGLIASACCHI, MARCO
openaire +2 more sources
In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether different services are to be invoked in parallel or in a sequence. In the latter case, we may have a configuration, called pipe join, in which the output of a service is used as input for ...
MARTINENGHI, DAVIDE, TAGLIASACCHI, MARCO
openaire +2 more sources
IEEE Transactions on Knowledge and Data Engineering, 2005
Given two spatial data sets A and B, a top-k spatial join retrieves the k objects from A or B that intersect the largest number of objects from the other data set. Depending on the application requirements, there exist several variations of the problem.
Manli Zhu +3 more
openaire +2 more sources
Given two spatial data sets A and B, a top-k spatial join retrieves the k objects from A or B that intersect the largest number of objects from the other data set. Depending on the application requirements, there exist several variations of the problem.
Manli Zhu +3 more
openaire +2 more sources
2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2012
Many distributed signal processing problems involve aggregating vectors of data, and often we are interested in the largest entries of the aggregate vector. For example, in distributed particle filtering one may be interested in fusing information about particles with the largest weights.
Deniz Üstebay, Michael G. Rabbat
openaire +1 more source
Many distributed signal processing problems involve aggregating vectors of data, and often we are interested in the largest entries of the aggregate vector. For example, in distributed particle filtering one may be interested in fusing information about particles with the largest weights.
Deniz Üstebay, Michael G. Rabbat
openaire +1 more source
Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, 2012
This paper investigates diversity queries over objects embedded in a low-dimensional vector space. An interesting case is provided by spatial Web objects, which are produced in great quantity by location-based services that let users attach content to places, and arise also in trip planning, news analysis, and real estate scenarios.
FRATERNALI, PIERO +2 more
openaire +1 more source
This paper investigates diversity queries over objects embedded in a low-dimensional vector space. An interesting case is provided by spatial Web objects, which are produced in great quantity by location-based services that let users attach content to places, and arise also in trip planning, news analysis, and real estate scenarios.
FRATERNALI, PIERO +2 more
openaire +1 more source
DC-Top-k: A Novel Top-k Selecting Algorithm and Its Parallelization
2016 45th International Conference on Parallel Processing (ICPP), 2016Sorting is a basic computational task in Computer Science. As a variant of the sorting problem, top-k selecting have been widely used. To our knowledge, on average, the state-of-the-art top-k selecting algorithm Partial Quicksort takes C(n, k) = 2(n+1)Hn+2n-6k+6-2(n+3-k)Hn+1-k comparisons and about C(n, k)/6 exchanges to select the largest k terms from
Zhengyuan Xue +4 more
openaire +1 more source
2014
Ensemble methods such as AdaBoost are popular machine learning methods that create highly accurate classifier by combining the predictions from several classifiers. We present a parametrized method of AdaBoost that we call Top-k Parametrized Boost. We evaluate our and other popular ensemble methods from a classification perspective on several real ...
Turki Turki +5 more
openaire +1 more source
Ensemble methods such as AdaBoost are popular machine learning methods that create highly accurate classifier by combining the predictions from several classifiers. We present a parametrized method of AdaBoost that we call Top-k Parametrized Boost. We evaluate our and other popular ensemble methods from a classification perspective on several real ...
Turki Turki +5 more
openaire +1 more source
Information Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Wang +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Wang +2 more
openaire +2 more sources