Browsing Luonnontieteiden, metsätieteiden ja tekniikan tiedekunta by Author "Fränti, Pasi"

Now showing items 1-20 of 27

    • A review of motion planning algorithms for intelligent robots 

      Zhou, Chengmin; Huang, Bingding; Fränti, Pasi (Springer Science and Business Media LLC, 2022)
      Principles of typical motion planning algorithms are investigated and analyzed in this paper. These algorithms include traditional planning algorithms, classical machine learning algorithms, optimal value reinforcement ...
      Tieteelliset aikakauslehtiartikkelit

    • Adapting k-means for graph clustering 

      Sieranoja, Sami; Fränti, Pasi (Springer Science and Business Media LLC, 2021)
      We propose two new algorithms for clustering graphs and networks. The first, called K‑algorithm, is derived directly from the k-means algorithm. It applies similar iterative local optimization but without the need to ...
      Tieteelliset aikakauslehtiartikkelit

    • Affective algorithmic composition of music: A systematic review 

      Wiafe, Abigail; Fränti, Pasi (AIMS Press, 2023)
      Affective music composition systems are known to trigger emotions in humans. However, the design of such systems to stimulate users' emotions continues to be a challenge because, studies that aggregate existing literature ...

    • All-pairwise squared distances lead to more balanced clustering 

      Malinen, Mikko I; Fränti, Pasi (AIMS Press, 2023)
      In clustering, the cost function that is commonly used involves calculating all-pairwise squared distances. In this paper, we formulate the cost function using mean squared error and show that this leads to more balanced ...

    • Balanced k-means revisited 

      de Maeyer, Rieke; Sieranoja, Sami; Fränti, Pasi (AIMS Press, 2023)
      The k-means algorithm aims at minimizing the variance within clusters without considering the balance of cluster sizes. Balanced k-means defines the partition as a pairing problem that enforces the cluster sizes to be ...

    • Combining statistical, structural, and linguistic features for keyword extraction from web pages 

      Shah, Himat; Fränti, Pasi (AIMS Press, 2022)
      Keywords are commonly used to summarize text documents. In this paper, we perform a systematic comparison of methods for automatic keyword extraction from web pages. The methods are based on three different types of features: ...

    • Comparison of eleven measures for estimating difficulty of open-loop TSP instances 

      Sengupta, Lahari; Fränti, Pasi (AIMS Press, 2021)
      From the theory of algorithms, we know that the time complexity of finding the optimal solution for a traveling salesman problem (TSP) grows exponentially with the number of targets. However, the size of the problem instance ...
      Tieteelliset aikakauslehtiartikkelit

    • Converting MST to TSP Path by Branch Elimination 

      Fränti, Pasi; Nenonen, Teemu; Yuan, Mingchuan (MDPI AG, 2020)
      Travelling salesman problem (TSP) has been widely studied for the classical closed loop variant but less attention has been paid to the open loop variant. Open loop solution has property of being also a spanning tree, ...
      Tieteelliset aikakauslehtiartikkelit

    • Dimensionally Distributed Density Estimation 

      Fränti, Pasi; Sieranoja, Sami (Springer International Publishing, 2018)
      Estimating density is needed in several clustering algorithms and other data analysis methods. Straightforward calculation takes O(N2) because of the calculation of all pairwise distances. This is the main bottleneck for ...
      Artikkelit ja abstraktit tieteellisissä konferenssijulkaisuissa

    • DOM-based keyword extraction from web pages 

      Shah, Himat; Rezaei, Mohammad; Fränti, Pasi (ACM Press, 2019)
      We present D-rank, an unsupervised, language and domain independent method for automatically extracting keywords from a single web page. The method does not use any corpus, and relies only on the information and features ...
      Artikkelit ja abstraktit tieteellisissä konferenssijulkaisuissa

    • Fast travel-distance estimation using overhead graph 

      Mariescu-Istodor, Radu; Fränti, Pasi (Informa UK Limited, 2021)
      Shortest path can be computed in real-time for single navigational instructions. However, in complex optimisation tasks, lots of travel-distances (lengths of shortest paths) are needed and the total workload becomes a ...
      Tieteelliset aikakauslehtiartikkelit

    • Framework for syntactic string similarity measures 

      Gali, Najlah; Mariescu-Istodor, Radu; Hostettler, Damien; Fränti, Pasi (Elsevier BV, 2019)
      Similarity measure is an essential component of information retrieval, document clustering, text summarization, and question answering, among others. In this paper, we introduce a general framework of syntactic similarity ...
      Tieteelliset aikakauslehtiartikkelit

    • How power distance affect motivation in cross-cultural environment: findings from Chinese companies in Europe 

      Wang, Shuo; Fränti, Pasi (American Institute of Mathematical Sciences, 2022)
      Motivation is a key factor for success in education and modern working life. Cross-cultural environment is a challenge to it and, if not taken into account, it can impair learning outcome and lead to high turnover rates ...

    • Image Segmentation by Pairwise Nearest Neighbor Using Mumford-Shah Model 

      Shah, Nilima; Patel, Dhanesh; Fränti, Pasi (IOS Press, 2021)
      Mumford-Shah model has been used for image segmentation by considering both homogeneity and the shape of the segments jointly. It has been previously optimized by complex mathematical optimization methods like Douglas-Rachford, ...
      Artikkelit ja abstraktit tieteellisissä konferenssijulkaisuissa

    • Is Medoid Suitable for Averaging GPS Trajectories? 

      Jimoh, Biliaminu; Mariescu-Istodor, Radu; Fränti, Pasi (MDPI, 2022)
      Averaging GPS trajectories is needed in applications such as clustering and automatic extraction of road segments. Calculating mean for trajectories and other time series data is non-trivial and shown to be an NP-hard ...

    • k-Means image segmentation using Mumford-Shah model 

      Shah, Nilima; Patel, Dhanesh; Fränti, Pasi (SPIE-Intl Soc Optical Eng, 2021)
      k-Means (KM) is well known for its ease of implementation as a clustering technique. It has been applied for color quantization in RGB, YUV, hyperspectral image, Lab, and other spaces, but this leads to fragmented segments ...
      Tieteelliset aikakauslehtiartikkelit

    • Mean-shift outlier detection 

      Yang, Jiawei; Rahardja, Susanto; Fränti, Pasi (IOS Press, 2018)
      Screening of an in-house library of compounds identified 12-thiazole abietanes as a new class of reversible inhibitors of the human metabolic serine hydrolase. Further optimization of the first hit compound lead to the ...
      conferenceObject

    • Optimal clustering by merge-based branch-and-bound 

      Fränti, Pasi; Virmajoki, Olli (AIMS Press, 2022)
      We present a method to construct optimal clustering via a sequence of merge steps. We formulate the merge-based clustering as a minimum redundancy search tree, and then search the optimal clustering by a branch-and-bound ...

    • Parallel random swap: An efficient and reliable clustering algorithm in java 

      Nigro, Libero; Cicirelli, Franco; Fränti, Pasi (Elsevier B.V., 2023)
      Solving large-scale clustering problems requires an efficient algorithm that can also be implemented in parallel. K-means would be suitable, but it can lead to an inaccurate clustering result. To overcome this problem, we ...

    • Planning Your Route: Where to Start? 

      Sengupta, Lahari; Mariescu-Istodor, Radu; Fränti, Pasi (Springer Nature, 2018)
      Tour planning is an important part of location-based applications. A tour planner provides an optimized path through places of interests (targets) by minimizing the tour length or by applying some other constraints. It is ...
      Tieteelliset aikakauslehtiartikkelit