The use of faceted browsing is common on shopping and comparison websites. When dealing with problems of this kind, it is usual practise to apply a specified set of features in a certain order. This tactic suffers from two major flaws that undermine its effectiveness. First things first: before you do anything else, you need to make sure that you set aside a significant amount of time to compile an effective list. Second, if you have a certain number of aspects and all of the products that are relevant to your search are tagged with the same aspect, then that particular aspect is basically worthless. This article presents a method for doing online business that makes use of a dynamic facet ordering system. On the basis of measurements for specificity and dispersion of aspect value dispersion, the entirely automated system assigns ratings to the characteristics and facets that lead to a speedy drill-down for each and every prospective target product. In contrast to the methodologies that are currently in use, the framework takes into consideration the subtleties that are specific to e-commerce. These nuances include the need for several clicks, the grouping of facets according to the traits that they share, and the predominance of numerical facets. In a large-scale simulation and user survey, our approach performed much better than the baseline greedy strategy, the facet list prepared by domain experts, and the state-of-the-art entropy-based solution. These comparisons were made using the same data

BASHA, Dr. S. RAHMAT

SABHA, SHIAK

SAMBASIVUDU, Dr. M.

English

International Journal of Innovative Technology and Research (IJITR)

Shiak Sabha* et al.  (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH Volume No.11, Issue No.2, February – March 2023, 10249 - 10252.   2320 –5547 @ 2013-2023 http://www.ijitr.com All rights Reserved. Page | 10249 Filter-Based Product Search Engines With Dynamic Component Ranking SHIAK SABHA M.Tech Student, Dept of CSE, Malla Reddy College of Engineering and Technology, Hyderabad, T.S, India Dr. S. RAHMAT BASHA Associate Professor, Dept of CSE, Malla Reddy College of Engineering and Technology, Hyderabad, T.S, India  Dr. M.SAMBASIVUDU Associate Professor, Dept of CSE, Malla Reddy College of Engineering and Technology, Hyderabad, T.S, India  Abstract: The use of faceted browsing is common on shopping and comparison websites. When dealing with problems of this kind, it is usual practise to apply a specified set of features in a certain order. This tactic suffers from two major flaws that undermine its effectiveness. First things first: before you do anything else, you need to make sure that you set aside a significant amount of time to compile an effective list. Second, if you have a certain number of aspects and all of the products that are relevant to your search are tagged with the same aspect, then that particular aspect is basically worthless. This article presents a method for doing online business that makes use of a dynamic facet ordering system. On the basis of measurements for specificity and dispersion of aspect value dispersion, the entirely automated system assigns ratings to the characteristics and facets that lead to a speedy drill-down for each and every prospective target product. In contrast to the methodologies that are currently in use, the framework takes into consideration the subtleties that are specific to e-commerce. These nuances include the need for several clicks, the grouping of facets according to the traits that they share, and the predominance of numerical facets. In a large-scale simulation and user survey, our approach performed much better than the baseline greedy strategy, the facet list prepared by domain experts, and the state-of-the-art entropy-based solution. These comparisons were made using the same data. Keywords: Facet Ordering; Product Search; User Interface; Web Shops; I.  INTRODUCTION: The most common scenario in which the use of faceted pursuit is beneficial is one in which the precise desired objective cannot be determined in advance. In place of item look using keyword-based searches, facets provide the user with the ability to constantly restrict the list items in successive stages by perusing a list of inquiry refinements. This is in contrast to item look, which uses keyword-based searches. In spite of this, one of the difficulties that come with faceted search, especially when it comes to doing business online, is the fact that there are such a large number of available facets [1]. When there are few features included, showing all aspects may be a solution; nonetheless, when there are more extensive arrangements of elements, it may be overwhelming for the customer. At this time, the majority of business systems that make use of faceted pursuit either employ a manually operated, "master-based" determination technique for facets or a largely static feature list. In any event, selecting and requesting faces demands a significant amount of physical effort on the part of the user. In addition, faceted scanning takes into consideration intuitive inquiry refining, which is the process wherein the importance of specific aspects and qualities may shift at any point throughout the search session. In this way, it is possible that a predetermined list of aspects would not be perfect in terms of the number of clicks required to discover the product that is sought. This study provides a technique for dynamic aspect ordering in the web-based business domain as a means of addressing the problem that has been identified. Dealing with areas that include an appropriate amount of unpredictability in terms of the characteristics and attributes of the items in question is the primary focus of our strategy. One excellent illustration of such a sector is the market for electronic products (referred to as "cell phones" in this book). A significant component of our response is the development of a computation that not only sorts the characteristics included in each property but also places properties according to the relevance of their respective qualities [2][3]. When it comes to requesting properties, we differentiate between specific characteristics whose aspects coordinate a number of different elements (i.e., with a high impurity). A maximum facet impurity measure, with regard to subjective facets in the comparison route as classes, and a measure of scattering for numeric facets are required for the method that has been presented. The objective is to provide a framework for collaborative filtering that is item-oriented and model-based. The iExpand technique presents a three-layer user-interests-item representation scheme. This scheme results in more accurate ranking suggestion results with Shiak Sabha* et al.  (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH Volume No.11, Issue No.2, February – March 2023, 10249 - 10252.   2320 –5547 @ 2013-2023 http://www.ijitr.com All rights Reserved. Page | 10250 less computing cost and helps with the understanding of the interactions that occur between users, things, and user interests. In addition, iExpand uses a strategic approach to address a number of challenges that are present in conventional methods of collaborative filtering. Some examples of these issues are the cold-start problem and the overspecialization problem [4]. In conclusion, we test iExpand on three standard data sets, and the results of our experiments show that iExpand has the potential to outperform approaches considered to be state-of-the-art by a significant margin.  II. PROBLEM STATEMENT: The present proposal for a faceted search engine places an emphasis not just on textual material but also on structured information. The purpose of the proposed system is to locate interesting characteristics given a keyword query. The unexpectedness of the aggregated value given the expectation determines the interestingness of an attribute. The authors believe that the navigational expectation is a unique interestingness measure that may be produced by the judicious use of p-values [5]. This is the primary addition that this study has made to the field. These solutions often make the assumption that there is a ranking of the results that is based on a previous keyword-based inquiry or other external data. However, this is not always the case for online shopping. There is a very large selection of aspects to choose from. When there are just a few aspects involved, displaying them all may be a workable approach; when there are a lot of facets involved, it might be overwhelming for the user. At the moment, the majority of commercial apps that employ faceted search have either a manual, "expert-based," or rather static facet list selection mechanism. Yet, choosing and sorting aspects manually demands a considerable amount of time and effort on the part of the user. In addition, faceted search makes it possible to do interactive query refining, which means that the relative weight that is given to certain attributes and facets may shift over the course of the search. As a result, it is very probable that a preset list of aspects will not be the most efficient in terms of the number of clicks that are required to locate the product that is requested [6]. It is quite probable that this strategy will not be appropriate for the field of e-commerce, which features the occurrence of tiny data sets and precludes the possibility of statistically extracting relevant properties. This approach does not take into account the usage of disjunctive semantics for values or the consideration of numeric aspects. III. PROPOSED METHODOLOGIES: In the field of online retailing, our idea is to use a method that employs dynamic facet ordering. The handling of domains that have an adequate level of complexity in terms of product features and values is the primary emphasis of our methodology. One sector that falls under this category is consumer electronics, namely what we refer to as "mobile phones" in this work. An essential component of our answer is the development of an algorithm that not only sorts the data contained inside each property but also ranks the attributes themselves in order of relevance. In order to arrange attributes, we find certain features whose aspects are similar across a variety of items (i.e., with a high impurity). The technique that has been suggested is predicated on a measure of facet impurity, which treats qualitative aspects in a manner similar to that of classes, and on a measure of dispersion for numeric facets. The property values are arranged in decreasing order based on the number of goods that correspond to them. In addition, a weighting system is used in order to prioritise aspects that match a large number of items above those that match a small number of products. This is done with the intention of reflecting the significance of facets. The way in which the user interacts with the search engine might provide some insight about the kinds of things that interest them. In this investigation, we make use of the common disjunctive semantics for describing values and the conjunctive semantics for describing characteristics. Moreover, we take into consideration the prospect of drill-ups. This indicates that it is reasonable to anticipate that the sizes of the result sets will, during the course of the search session, either rise or decrease, depending on whether a facet in a property is selected or deselected. Our strategy seems to perform better than the other ways in terms of the number of clicks required, with the exception of the Best Facet Drill-Down Model, for which each strategy performs about as well as the other strategy. In addition, when applied to the Combined Drill-Down Model, our method produces the largest proportion of successful sessions while simultaneously reducing the number of roll-ups that occur. Since it requires a relatively modest amount of processing time, it is acceptable for usage in real-world online stores; hence, our results are also relevant to industry. These findings have also been validated by the results of a user-centered assessment study that we conducted.  IV. ENHANCED SYSTEM: During a search session, what is known as a "query" is defined as a collection of previously chosen "facets." We have settled on the idea of applying disjunctive semantics to certain of the aspects that are included in a property. Conjunctive semantics is what we use for aspects that cut across several attributes. For instance, if you pick the criteria Color: Black, Brand: Samsung, and Brand: Apple, you will get the combination of (Brand: Samsung OR Brand: Apple) AND Color: Shiak Sabha* et al.  (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH Volume No.11, Issue No.2, February – March 2023, 10249 - 10252.   2320 –5547 @ 2013-2023 http://www.ijitr.com All rights Reserved. Page | 10251 Black. Numerous online retailers, such as Amazon.com and BestBuy.com, employ the same basic concept, which, from the perspective of someone who has never used an online retailer before, is quite easy to understand. Our strategy is based on the presumption that users are able to do two distinct sorts of actions: drill down and roll up. The process of choosing one or more aspects in order to narrow the focus of the search and produce a smaller overall result set is known as a "drilldown." When the user realises that the specified aspects are being applied in a too stringent manner, it is possible that they will do a roll-up operation, which will cause the size of the result set to grow. In this section, we will go through the specifics of calculating property scores, which is one of the two procedures depicted at the beginning of the diagram. The end result of the property scores is used first for the purpose of sorting the properties, and then the facet scores are employed for the purpose of sorting the values included inside each property. Here, we focus on the primary stages involved in calculating the property score. The graphic demonstrates that the score for each attribute was miscalculated independently, and this process may thus be done simultaneously. The suggested algorithm was developed by us in such a manner that the aspects and features that are more particular get higher rankings. The count of disconnected facets is a new metric that was developed to assist the algorithm in determining which aspects are more specific. This measure was used in the scoring calculation for the qualitative characteristics. We have decided to compute property scores based on the information we have about the distribution of the numeric values when it comes to properties that have numeric values. Since the values for the result set are all over the place, it's not hard to see how handy it may be to drill down using a number attribute. This is something that comes to mind rather easily. A drill-down that makes use of a user-defined range would result in a significant decrease in the resultset in situations in which the facets are roughly evenly distributed over the whole range of values. Winnow has measures to score both qualitative and quantitative features, and these metrics are the Gina impurity and the Gina coefficient. This score is not influenced in any way by the quantity of output upon which it is based. Because of this, features that are seen in a small percentage of items will be given a score that is comparatively higher than other attributes. We have decided to implement the product count weighting in order to make up for this. The various indices are normalised via the application of the product count weighting, which ultimately results in the final property score. We have included an explanation of how we calculate scores for attributes throughout this module. In this section, we will go through the specifics of calculating facet scores, which is one of the first two procedures presented. But, in order to make the process of scanning data more efficient, our method sorts the values that are included inside each property. This is in contrast to, for example, the strategy used when quitting, which takes into account the ordering of properties but ignores the ranking of aspects. While numeric attributes are often displayed in user interfaces using a slider widget, the value ordering of these properties is typically disregarded. The slider widgets, of which this is an example, provide an indicator of the lowest and highest values for a property and enable the user to freely construct a range of aspects within these bounds. An example of a slider widget can be found here. Our method makes use of the aspect count for qualitative qualities, ranking facets per attribute based on their count in decreasing order. Since the system does not know what the target product is, this will enhance the likelihood that an aspect that is similar to the target product will be shown on top.  Fig 1: Sequence of System V. CONCLUSION: We suggested a strategy that mechanically arranges the many aspects in such a way that the user may locate the product she wants with the least amount of work possible. The basic concept behind our proposed method is to first sort properties according to the facets of those properties and then, in addition to that, to also sort the facets themselves. To evaluate both the qualitative and numerical aspects of a property, we make use of a variety of metrics. When it comes to the ranking of attributes, we want to rank them in decreasing order based on their level of impurity, encouraging more selected aspects that will lead to a Shiak Sabha* et al.  (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH Volume No.11, Issue No.2, February – March 2023, 10249 - 10252.   2320 –5547 @ 2013-2023 http://www.ijitr.com All rights Reserved. Page | 10252 rapid drill-down of the findings. In addition, in order to handle missing data in an appropriate manner and to take into consideration the property's product coverage, we make use of a weighting method that is dependent on the number of matching goods. In order to assess the effectiveness of our strategy, we run a comprehensive series of simulation tests and compare it to three other strategies. In the process of measuring the user effort, particularly in terms of the number of clicks, we were able to come to the conclusion that our technique provides a higher performance than the benchmark approaches, and in some instances, it even outperforms the manually curated "expert-based" method. In addition, the very low amount of processing time required makes it appropriate for usage in real-life online stores, which further validates the applicability of our results to the business world. These findings have also been validated by the results of a user-centered assessment study that we conducted.  REFERENCES: [1]  H. Zo and K. Ramamurthy, “Consumer Selection of ECommerce Websites in a B2C Environment: A Discrete Decision Choice Model,” IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, vol. 39, no. 4, pp. 819–839,2009. [2]  M. Hearst, “Design Recommendations for Hierarchical FacetedSearch Interfaces,” in 29th Annual International Conference on Research & Development on Information Retrieval (ACM SIGIR 2006). ACM, 2006. [3]  D. Tunkelang, “Faceted Search,” Synthesis Lectures on InformationConcepts, Retrieval, and Services, vol. 1, no. 1, pp. 1–80, 2009. [4]  K.-P. Yee, K. Swearingen, K. Li, and M. Hearst, “Faceted Metadata for Image Search and Browsing,” in Proceedings of the SIGCHI Conference on Human factors in Computing Systems.ACM, 2003, pp. 401–408. [5]  J. C. Fagan, “Usability Studies of Faceted Browsing: A Literature Review,” Information Technology and Libraries, vol. 29, no. 2, p. 58, 2010. [6]  M. Hearst, A. Elliott, J. English, R. Sinha, K. Swearingen, and K.- P. Yee, “Finding the Flow in Web Site Search,” Communications of the ACM, vol. 45, no. 9, pp. 42–49, 2002. [7]  B. Kules, R. Capra, M. Banta, and T. Sierra,“What Do Exploratory Searchers Look at in a Faceted Search Interface?” in 9th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL 2009). ACM, 2009, pp. 313–322. [8]  Amazon.com, “Large US-based online retailer,” http://www.amazon.com, 2014. [9]  V. Sinha and D. R. Karger, “Magnet: Supporting Navigation in Semi-structured Data Environments,” in 24th ACM SIGMODInternational Conference on Management of Data (SIGMOD 2005). ACM, 2005, pp. 97–106. [10]  Kieskeurig.nl, “Major Dutch price comparison engine with detailed product descriptions,” http://www.kieskeurig.nl, 2014. 

Filter-Based Product Search Engines With Dynamic Component Ranking

https://www.ijitr.com/index.php/ojs/article/download/2780/pdf

Filter-Based Product Search Engines With Dynamic Component Ranking

Abstract

Similar works

Full text

Available Versions

International Journal of Innovative Technology and Research (IJITR)