Dataset Information

Definition of customer requirements in big data using word vectors and affinity propagation clustering.

ABSTRACT: Customer requirements (CRs) have a significant impact on product design. The existing methods of defining CRs, such as customer surveys and expert evaluations, are time-consuming, inaccurate and subjective. This paper proposes an automatic CRs definition method based on online customer product reviews using the big data analysis. Word vectors are defined using a continuous bag of words (CBOW) model. Online customer reviews are searched by a crawling method and filtered by the parts of speech and frequency of words. Filtered words are then clustered into groups by an affinity propagation (AP) clustering method based on trained word vectors. Exemplars in each clustering group are finally used to define CRs. The proposed method is verified by case studies of defining CRs for product design. Results show that the proposed method has better performance to determine CRs compared to existing CRs definition methods.

SUBMITTER: Shi Y

PROVIDER: S-EPMC8494268 | biostudies-literature | 2021 Oct

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Definition of customer requirements in big data using word vectors and affinity propagation clustering.

Shi Yanlin Y Peng Qingjin Q

Proceedings of the Institution of Mechanical Engineers. Part E, Journal of process mechanical engineering 20210316 5

Customer requirements (CRs) have a significant impact on product design. The existing methods of defining CRs, such as customer surveys and expert evaluations, are time-consuming, inaccurate and subjective. This paper proposes an automatic CRs definition method based on online customer product reviews using the big data analysis. Word vectors are defined using a continuous bag of words (CBOW) model. Online customer reviews are searched by a crawling method and filtered by the parts of speech and ...[more]

PMID: 34629763

Similar Datasets

Project description:BACKGROUND: Genome scale data on protein interactions are generally represented as large networks, or graphs, where hundreds or thousands of proteins are linked to one another. Since proteins tend to function in groups, or complexes, an important goal has been to reliably identify protein complexes from these graphs. This task is commonly executed using clustering procedures, which aim at detecting densely connected regions within the interaction graphs. There exists a wealth of clustering algorithms, some of which have been applied to this problem. One of the most successful clustering procedures in this context has been the Markov Cluster algorithm (MCL), which was recently shown to outperform a number of other procedures, some of which were specifically designed for partitioning protein interactions graphs. A novel promising clustering procedure termed Affinity Propagation (AP) was recently shown to be particularly effective, and much faster than other methods for a variety of problems, but has not yet been applied to partition protein interaction graphs. RESULTS: In this work we compare the performance of the Affinity Propagation (AP) and Markov Clustering (MCL) procedures. To this end we derive an unweighted network of protein-protein interactions from a set of 408 protein complexes from S. cervisiae hand curated in-house, and evaluate the performance of the two clustering algorithms in recalling the annotated complexes. In doing so the parameter space of each algorithm is sampled in order to select optimal values for these parameters, and the robustness of the algorithms is assessed by quantifying the level of complex recall as interactions are randomly added or removed to the network to simulate noise. To evaluate the performance on a weighted protein interaction graph, we also apply the two algorithms to the consolidated protein interaction network of S. cerevisiae, derived from genome scale purification experiments and to versions of this network in which varying proportions of the links have been randomly shuffled. CONCLUSION: Our analysis shows that the MCL procedure is significantly more tolerant to noise and behaves more robustly than the AP algorithm. The advantage of MCL over AP is dramatic for unweighted protein interaction graphs, as AP displays severe convergence problems on the majority of the unweighted graph versions that we tested, whereas MCL continues to identify meaningful clusters, albeit fewer of them, as the level of noise in the graph increases. MCL thus remains the method of choice for identifying protein complexes from binary interaction networks.

Project description:By combining a reference-independent SNP analysis and average nucleotide identity (ANI) with affinity propagation clustering (APC), we developed a significantly improved methodology allowing resolving phylogenetic relationships, based on objective criteria. These bioinformatics tools can be used as a general ruler to determine phylogenetic relationships and clustering of bacteria, exemplary done with Francisella (F.) tularensis. Molecular epidemiology of F. tularensis is currently assessed mostly based on laboratory methods and molecular analysis. The high evolutionary stability and the clonal nature makes Francisella ideal for subtyping with single nucleotide polymorphisms (SNPs). Sequencing and real-time PCR can be used to validate the SNP analysis. We investigate whole-genome sequences of 155 F. tularensis subsp. holarctica isolates. Phylogenetic testing was based on SNPs and average nucleotide identity (ANI) as reference independent, alignment-free methods taking small-scale and large-scale differences within the genomes into account. Especially the whole genome SNP analysis with kSNP3.0 allowed deciphering quite subtle signals of systematic differences in molecular variation. Affinity propagation clustering (APC) resulted in three clusters showing the known clades B.4, B.6, and B.12. These data correlated with the results of real-time PCR assays targeting canSNPs loci. Additionally, we detected two subtle sub-clusters. SplitsTree was used with standard-setting using the aligned SNPs from Parsnps. Together APC, HierBAPS, and SplitsTree enabled us to generate hypotheses about epidemiologic relationships between bacterial clusters and describing the distribution of isolates. Our data indicate that the choice of the typing technique can increase our understanding of the pathogenesis and transmission of diseases with the eventual for prevention. This is opening perspectives to be applied to other bacterial species. The data provide evidence that Germany might be the collision zone where the clade B.12, also known as the East European clade, overlaps with the clade B.6, also known as the Iberian clade. Described methods allow generating a new, more detailed perspective for F. tularensis subsp. holarctica phylogeny. These results may encourage to determine phylogenetic relationships and clustering of other bacteria the same way.

Dataset Information

Definition of customer requirements in big data using word vectors and affinity propagation clustering.

Publications

Definition of customer requirements in big data using word vectors and affinity propagation clustering.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets