Abstract This paper introduces SensoGraph, a novel approach for fast sensory evaluation using two-dimensional geometric techniques. In the tasting sessions, the assessors follow their own criteria to place samples on a tablecloth, according to the similarity between samples. In order to analyse the data collected, first a geometric clustering is performed to each tablecloth, extracting connections between the samples. Then, these connections are used to construct a global similarity matrix. Finally, a graph drawing algorithm is used to obtain a 2D consensus graphic, which reflects the global opinion of the panel by (1) positioning closer those samples that have been globally perceived as similar and (2) showing the strength of the connections between samples. The proposal is validated by performing four tasting sessions, with three types of panels tasting different wines, and by developing a new software to implement the proposed techniques. The results obtained show that the graphics provide similar positionings of the samples as the consensus maps obtained by multiple factor analysis (MFA), further providing extra information about connections between samples, not present in any previous method. The main conclusion is that the use of geometric techniques provides information complementary to MFA, and of a different type. Finally, the method proposed is computationally able to manage a significantly larger number of assessors than MFA, which can be useful for the comparison of pictures by a huge number of consumers, via the Internet.
Thus, several alternative methods have arisen in the last years , aiming to provide a fast sensory positioning of a set of products by assessors who are not necessarily trained. Skipping the need to train the panellists allows to elude the need of waiting a long time before obtaining results, as well as the need of agreeing on particular attributes, which may become difficult when working with experts like wine professionals or chefs . Introduced by @cite_2 @cite_10 , Projective Mapping asks the assessors to position the presented samples on a two-dimensional space, usually a blank sheet of paper as tablecloth, following their own criteria: The more similar they perceive two samples, the closer they should position them, and vice versa . In those seminal works, the data were analysed by generalized procrustes analysis (GPA) and principal component analysis (PCA) , using the RV coefficient to compare the method with conventional profiling.
@cite_10 @cite_2
1979883873 2065540379
Abstract Studies have indicated that profiling and (dis)similarity scaling yield different perceptual product maps. Conceptually, these two procedures are different. This paper looks at a third and alternative method of producing a two-dimensional, perceptual map utilizing a projective-type method whereby individual assessors themselves are required to place products on the space according to the similarities and differences they perceive. However, visual comparison of the final results provided by each assessor is difficult and, hence, generalized Procrustes analysis is applied to compare each assessor's map for similarity with the others. In this study it was found that the perceptual map derived from projective mapping was as similar to the map derived from profiling as from dissimilarity scaling. However, consistency over repeated trials was greater for projective mapping than for the other two methods. It is suggested that projective mapping could be a potentially useful technique for linking sensory analysis and consumer research data. Abstract This paper deals with the method of projective mapping and its use in sensory analysis. Projective mapping is a method which allows naive consumers to map products on a two dimension space, based on similarities and differences in the products. An experiment was carried out on seven blueberry soups, whereby sensory profiling was undertaken using a trained panel and projective mapping. Preference assessment was undertaken using a small group of consumers. Results indicated that the three replicates of the mapping exercise produced visually very similar maps, at least on the first two dimensions. However, it was found that consumers perceived the samples in somewhat different ways as high-lighted by RV coefficients. The consensus mapping dimensions were compared to those from the profile data, and it was apparent that the best similarity was found when comparing the first dimension, thus suggesting good agreement on the obvious aspects of the product. The internal preference map also revealed major product contrasts along this dimension with some weak evidence of segmentation. The overall conclusion of this paper raises further fundamental questions about consensus spaces with consumers, and the question of dimensionality of consumer perception as compared to trained panels. We introduce kernel entropy component analysis (kernel ECA) as a new method for data transformation and dimensionality reduction. Kernel ECA reveals structure relating to the Renyi entropy of the input space data set, estimated via a kernel matrix using Parzen windowing. This is achieved by projections onto a subset of entropy preserving kernel principal component analysis (kernel PCA) axes. This subset does not need, in general, to correspond to the top eigenvalues of the kernel matrix, in contrast to the dimensionality reduction using kernel PCA. We show that kernel ECA may produce strikingly different transformed data sets compared to kernel PCA, with a distinct angle-based structure. A new spectral clustering algorithm utilizing this structure is developed with positive results. Furthermore, kernel ECA is shown to be an useful alternative for pattern denoising. How do we find patterns in author-keyword associations, evolving over time? Or in Data Cubes, with product-branch-customer sales information? Matrix decompositions, like principal component analysis (PCA) and variants, are invaluable tools for mining, dimensionality reduction, feature selection, rule identification in numerous settings like streaming data, text, graphs, social networks and many more. However, they have only two orders, like author and keyword, in the above example.We propose to envision such higher order data as tensors,and tap the vast literature on the topic. However, these methods do not necessarily scale up, let alone operate on semi-infinite streams. Thus, we introduce the dynamic tensor analysis (DTA) method, and its variants. DTA provides a compact summary for high-order and high-dimensional data, and it also reveals the hidden correlations. Algorithmically, we designed DTA very carefully so that it is (a) scalable, (b) space efficient (it does not need to store the past) and (c) fully automatic with no need for user defined parameters. Moreover, we propose STA, a streaming tensor analysis method, which provides a fast, streaming approximation to DTA.We implemented all our methods, and applied them in two real settings, namely, anomaly detection and multi-way latent semantic indexing. We used two real, large datasets, one on network flow data (100GB over 1 month) and one from DBLP (200MB over 25 years). Our experiments show that our methods are fast, accurate and that they find interesting patterns and outliers on the real datasets.