Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Computer Engineering

Spatiotemporal Mode Analysis Of Urban Dockless Shared Bikes Based On Point Of Interests Clustering, Zhang Fang, Bin Chen, Yanghua Tang, Dong Jian, Chuan Ai, Xiaogang Qiu Dec 2019

Spatiotemporal Mode Analysis Of Urban Dockless Shared Bikes Based On Point Of Interests Clustering, Zhang Fang, Bin Chen, Yanghua Tang, Dong Jian, Chuan Ai, Xiaogang Qiu

Journal of System Simulation

Abstract: The city’s dockless shared bikes have developed rapidly, and its features of convenience, economy and efficiency have been widely welcomed. The digital footprint they generate reveals the movement of people in time and space within the city, which makes it possible to quantify the activities of people in the city using shared bikes. In this paper, based on the collected shared bikes data of Beijing, a clustering method based on the point of interests is proposed to divide the urban space, so as to construct a mobile network of urban shared bikes, and analysis the spatiotemporal mode of bike …


Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao May 2019

Cure: Flexible Categorical Data Representation By Hierarchical Coupling Learning, Songlei Jian, Guansong Pang, Longbing Cao, Kai Lu, Hang Gao

Research Collection School Of Computing and Information Systems

The representation of categorical data with hierarchical value coupling relationships (i.e., various value-to-value cluster interactions) is very critical yet challenging for capturing complex data characteristics in learning tasks. This paper proposes a novel and flexible coupled unsupervised categorical data representation (CURE) framework, which not only captures the hierarchical couplings but is also flexible enough to be instantiated for contrastive learning tasks. CURE first learns the value clusters of different granularities based on multiple value coupling functions and then learns the value representation from the couplings between the obtained value clusters. With two complementary value coupling functions, CURE is instantiated into …


Exploring Bigram Character Features For Arabic Text Clustering, Dia Eddin Abuzeina Jan 2019

Exploring Bigram Character Features For Arabic Text Clustering, Dia Eddin Abuzeina

Turkish Journal of Electrical Engineering and Computer Sciences

The vector space model (VSM) is an algebraic model that is widely used for data representation in text mining applications. However, the VSM poses a critical challenge, as it requires a high-dimensional feature space. Therefore, many feature selection techniques, such as employing roots or stems (i.e. words without infixes and prefixes, and/or suffixes) instead of using complete word forms, are proposed to tackle this space challenge problem. Recently, the literature shows that one more basic unit feature can be used to handle the textual features, which is the twoneighboring character form that we call microword. To evaluate this feature type, …


A New Model To Determine The Hierarchical Structure Of The Wireless Sensor Networks, Resmi̇ye Nasi̇boğlu, Zülküf Teki̇n Erten Jan 2019

A New Model To Determine The Hierarchical Structure Of The Wireless Sensor Networks, Resmi̇ye Nasi̇boğlu, Zülküf Teki̇n Erten

Turkish Journal of Electrical Engineering and Computer Sciences

Wireless sensor networks are one of the rising areas of scientific research. Common purpose of these investigations is usually constructing optimal structure of the network by prolonging its lifetime. In this study, a new model has been proposed to construct a hierarchical structure of wireless sensor networks. Methods used in the model to determine clusters and appropriate cluster heads are k-means clustering and fuzzy inference system (FIS), respectively. The weighted averaging based on levels (WABL) defuzzification method is used to calculate crisp outputs of the FIS. A new theorem for calculation of WABL values has been proved in order to …


Evaluating The Attributes Of Remote Sensing Image Pixels For Fast K-Means Clustering, Ali̇ Sağlam, Nurdan Baykan Jan 2019

Evaluating The Attributes Of Remote Sensing Image Pixels For Fast K-Means Clustering, Ali̇ Sağlam, Nurdan Baykan

Turkish Journal of Electrical Engineering and Computer Sciences

Clustering process is an important stage for many data mining applications. In this process, data elements are grouped according to their similarities. One of the most known clustering algorithms is the k-means algorithm. The algorithm initially requires the number of clusters as a parameter and runs iteratively. Many remote sensing image processing applications usually need the clustering stage like many image processing applications. Remote sensing images provide more information about the environments with the development of the multispectral sensor and laser technologies. In the dataset used in this paper, the infrared (IR) and the digital surface maps (DSM) are also …


Efficient Hierarchical Temporal Segmentation Method For Facial Expression Sequences, Jiali Bian, Xue Mei, Yu Xue, Liang Wu, Yao Ding Jan 2019

Efficient Hierarchical Temporal Segmentation Method For Facial Expression Sequences, Jiali Bian, Xue Mei, Yu Xue, Liang Wu, Yao Ding

Turkish Journal of Electrical Engineering and Computer Sciences

Temporal segmentation of facial expression sequences is important to understand and analyze human facial expressions. It is, however, challenging to deal with the complexity of facial muscle movements by finding a suitable metric to distinguish among different expressions and to deal with the uncontrolled environmental factors in the real world. This paper presents a two-step unsupervised segmentation method composed of rough segmentation and fine segmentation stages to compute the optimal segmentation positions in video sequences to facilitate the segmentation of different facial expressions. The proposed method performs localization of facial expression patches to aid in recognition and extraction of specific …


Scalable Clustering For Immune Repertoire Sequence Analysis, Prem Bhusal Jan 2019

Scalable Clustering For Immune Repertoire Sequence Analysis, Prem Bhusal

Browse all Theses and Dissertations

The development of the next-generation sequencing technology has enabled systems immunology researchers to conduct detailed immune repertoire analysis at the molecule level. Large sequence datasets (e.g., millions of sequences) are being collected to comprehensively understand how the immune system of a patient evolves over different stages of disease development. A recent study has shown that the hierarchical clustering (HC) algorithm gives the best results for B-cell clones analysis - an important type of immune repertoire sequencing (IR-Seq) analysis. However, due to the inherent complexity, the classical hierarchical clustering algorithm does not scale well to large sequence datasets. Surprisingly, no algorithms …