4 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 4 / 4
Yayın VC-dimension of univariate decision trees(IEEE-INST Electrical Electronics Engineers Inc, 2015-02-25) Yıldız, Olcay TanerIn this paper, we give and prove the lower bounds of the Vapnik-Chervonenkis (VC)-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension values of its subtrees and the number of inputs. Via a search algorithm that calculates the VC-dimension of univariate decision trees exhaustively, we show that our VC-dimension bounds are tight for simple trees. To verify that the VC-dimension bounds are useful, we also use them to get VC-generalization bounds for complexity control using structural risk minimization in decision trees, i.e., pruning. Our simulation results show that structural risk minimization pruning using the VC-dimension bounds finds trees that are more accurate as those pruned using cross validation.Yayın Power control for two user cooperative OFDMA channels(IEEE-INST Electrical Electronics Engineers Inc, 2013-01) Bakım, İsmail Sezi; Kaya, OnurFor a two user cooperative orthogonal frequency division multiple access (OFDMA) system with full channel state information (CSI), we obtain the optimal power allocation (PA) policies which maximize the rate region achievable by a channel adaptive implementation of inter-subchannel block Markov superposition encoding (BMSE), used in conjunction with backwards decoding. We provide the optimality conditions that need to be satisfied by the powers associated with the users' codewords and derive the closed form expressions for the optimal powers. We propose two algorithms that can be used to optimize the powers to achieve any desired rate pair on the rate region boundary: a projected subgradient algorithm, and an iterative waterfilling-like algorithm based on Karush-Kuhn-Tucker (KKT) conditions for optimality, which operates one user at a time and converges much faster. We observe that, utilization of power control to take advantage of the diversity offered by the cooperative OFDMA system, not only leads to a remarkable improvement in achievable rates, but also may help determine how the subchannels have to be instantaneously allocated to various tasks in cooperation. Simulations show that the gain from power allocation is still significant even when the CSI feedback is limited.Yayın Rate-distortion and complexity optimized motion estimation for H.264 video coding(IEEE-INST Electrical Electronics Engineers Inc, 2008-02) Ateş, Hasan Fehmi; Altunbaşak, Yücel11.264 video coding standard supports several inter-prediction coding modes that use macroblock (MB) partitions with variable block sizes. Rate-distortion (R-D) optimal selection of both the motion vectors (MVs) and the coding mode of each MB is essential for an H.264 encoder to achieve superior coding efficiency. Unfortunately, searching for optimal MVs of each possible subblock incurs a heavy computational cost. In this paper, in order to reduce the computational burden of integer-pel motion estimation (ME) without sacrificing from the coding performance, we propose a R-D and complexity joint optimization framework. Within this framework, we develop a simple method that determines for each MB which partitions are likely to be optimal. MV search is carried out for only the selected partitions, thus reducing the complexity of the ME step. The mode selection criteria is based on a measure of spatiotemporal activity within the MB. The procedure minimizes the coding loss at a given level of computational complexity either for the full video sequence or for each single frame. For the latter case, the algorithm provides a tight upper bound on the worst case complexity/execution time of the ME module. Simulation results show that the algorithm speeds up integer-pel ME by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.Yayın Re-mining item associations: Methodology and a case study in apparel retailing(Elsevier Science BV, 2011-12) Demiriz, Ayhan; Ertek, Gürdal; Atan, Sabri Tankut; Kula, UfukAssociation mining is the conventional data mining technique for analyzing market basket data and it reveals the positive and negative associations between items. While being an integral part of transaction data, pricing and time information have not been integrated into market basket analysis in earlier studies. This paper proposes a new approach to mine price, time and domain related attributes through re-mining of association mining results. The underlying factors behind positive and negative relationships can be characterized and described through this second data mining stage. The applicability of the methodology is demonstrated through the analysis of data coming from a large apparel retail chain, and its algorithmic complexity is analyzed in comparison to the existing techniques.
