4 results
Search Results
Now showing 1 - 4 of 4
Conference Object Citation - WoS: 1Citation - Scopus: 2An on Demand Virtual CPU Arhitecture based on Cloud Infrastructure(Scitepress, 2017) Gokcay, ErhanCloud technology provides different computational models like, including but not limited to, infrastructure, platform and software as a service. The motivation of a cloud system is based on sharing resources in an optimal and cost effective way by creating virtualized resources that can be distributed easily but the distribution is not necessarily parallel. Another disadvantage is that small computational units like smart devices and less powerful computers, are excluded from resource sharing. Also different systems may have interoperability problems, since the operating system and CPU design differs from each other. In this paper, an on demand dynamically created computational architecture, inspired from the CPU design and called Cloud CPU, is described that can use any type of resource including all smart devices. The computational and data transfer requirements from each unit are minimized. Because of this, the service can be created on demand, each time with a different functionality. The distribution of the calculation over not-so-fast internet connections is compensated by a massively parallel operation. The minimized computational requirements will also reduce the interoperability problems and it will increase fault tolerance because of increased number of units in the system.Conference Object Citation - Scopus: 1Similarity-Inclusive Link Prediction With Quaternions(Scitepress, 2021) Kurt, Zuhal; Gerek, Omer Nezih; Bilge, Alper; Ozkan, KemalThis paper proposes a Quaternion-based link prediction method, a novel representation learning method for recommendation purposes. The proposed algorithm depends on and computation with Quaternion algebra, benefiting from the expressiveness and rich representation learning capability of the Hamilton products. The proposed method depends on a link prediction approach and reveals the significant potential for performance improvement in top-N recommendation tasks. The experimental results indicate the superior performance of the approach using two quality measurements - hits rate, and coverage - on the Movielens and Hetrec datasets. Additionally, extensive experiments are conducted on three subsets of the Amazon dataset to understand the flexibility of this algorithm to incorporate different information sources and demonstrate the effectiveness of Quaternion algebra in graph-based recommendation algorithms. The proposed algorithms obtain comparatively higher performance, they are improved with similarity factors. The results show that the proposed quaternion-based algorithm can effectively deal with the deficiencies in graph-based recommender system, making it a preferable alternative among the other available methods.Conference Object Citation - WoS: 2CAWP A Combinatorial Auction Web Platform(Scitepress, 2010) Cereci, Ibrahim; Kilic, HurevrenOnline auctions, including online Combinatorial Auctions, are important examples of e-commerce applications. In this paper, a Combinatorial Auction Web Platform (CAWP) is introduced. The platform enables both product selling and buying capabilities that can be realized in a combinatorial way. CAWP supports a Sealed-Bid Single-Unit type of Combinatorial Auctions. Easy customization for any selected problem domain is a distinguished feature of CAWP. Platform users are not expected to have any technical knowledge about how to solve the Winner Determination Problem (WDP) known to be critical for profit maximization of the auctioneers in Combinatorial Auctions.Conference Object Citation - Scopus: 2A Stream Clustering Algorithm Using Information Theoretic Clustering Evaluation Function(Scitepress, 2018) Gokcay, ErhanThere are many stream clustering algorithms that can be divided roughly into density based algorithms and hyper spherical distance based algorithms. Only density based algorithms can detect nonlinear clusters and all algorithms assume that the data stream is an ordered sequence of points. Many algorithms need to receive data in buckets to start processing with online and offline iterations with several passes over the data. In this paper we propose a streaming clustering algorithm using a distance function which can separate highly nonlinear clusters in one pass. The distance function used is based on information theoretic measures and it is called Clustering Evaluation Function. The algorithm can handle data one point at a time and find the correct number of clusters even with highly nonlinear clusters. The data points can arrive in any random order and the number of clusters does not need to be specified. Each point is compared against already discovered clusters and each time clusters are joined or divided using an iteratively updated threshold.
