Clustering frequent navigation patterns from website logs by using ontology and temporal information

Kilic, Sefa
Karagöz, Pınar
Toroslu, İsmail Hakkı
In this work, clustering algorithms are used in order to group similar frequent sequences of Web page visits. A new sequence is compared with all clusters and it is assigned to the most similar one. This work can be used for predicting and prefetching the next page user will visit or for helping the navigation of user in the website. They can also be used to improve the structure of website for easier navigation. In this study the effect of time spent on each web page during the session is also analyzed. © 2013 Springer-Verlag London.


Tuning of handover parameters in LTE-A heterogeneous networks
Tunçel, Emrah; Şener, Cevat; Department of Computer Engineering (2014)
In this work, a new handover parameter optimization algorithm for the LTE-A networks is presented. Most of the previous solutions that are proposed to solve the handover parameter optimization problem, optimize the handover parameters with considering all of the neighbor cells together. But with the introduction of heterogeneous networks to the LTE-A standards, the deployments are no longer homogeneous and the cell borders have different inter-cell interference conditions that changes according to the diffe...
Consensus clustering of time series data
Yetere Kurşun, Ayça; Batmaz, İnci; İyigün, Cem; Department of Scientific Computing (2014)
In this study, we aim to develop a methodology that merges Dynamic Time Warping (DTW) and consensus clustering in a single algorithm. Mostly used time series distance measures require data to be of the same length and measure the distance between time series data mostly depends on the similarity of each coinciding data pair in time. DTW is a relatively new measure used to compare two time dependent sequences which may be out of phase or may not have the same lengths or frequencies. DTW aligns two time serie...
Multi-Modal Learning With Generalizable Nonlinear Dimensionality Reduction
KAYA, SEMİH; Vural, Elif (2019-08-26)
In practical machine learning settings, there often exist relations or links between data from different modalities. The goal of multimodal learning algorithms is to efficiently use the information available in different modalities to solve multi-modal classification or retrieval problems. In this study, we propose a multi-modal supervised representation learning algorithm based on nonlinear dimensionality reduction. Nonlinear embeddings often yield more flexible representations compared to linear counterpa...
Multi-resolution visualization of large scale protein networks enriched with gene ontology annotations
Yaşar, Sevgi; Can, Tolga; Department of Computer Engineering (2009)
Genome scale protein-protein interactions (PPIs) are interpreted as networks or graphs with thousands of nodes from the perspective of computer science. PPI networks represent various types of possible interactions among proteins or genes of a genome. PPI data is vital in protein function prediction since functions of the cells are performed by groups of proteins interacting with each other and main complexes of the cell are made of proteins interacting with each other. Recent increase in protein interactio...
Cross-modal Representation Learning with Nonlinear Dimensionality Reduction
KAYA, SEMİH; Vural, Elif (2019-08-22)
In many problems in machine learning there exist relations between data collections from different modalities. The purpose of multi-modal learning algorithms is to efficiently use the information present in different modalities when solving multi-modal retrieval problems. In this work, a multi-modal representation learning algorithm is proposed, which is based on nonlinear dimensionality reduction. Compared to linear dimensionality reduction methods, nonlinear methods provide more flexible representations e...
Citation Formats
S. Kilic, P. Karagöz, and İ. H. Toroslu, “Clustering frequent navigation patterns from website logs by using ontology and temporal information,” 2013, Accessed: 00, 2020. [Online]. Available: