predicting missing item in shopping carts
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
hemnath.k
Active In SP
**

Posts: 1
Joined: Feb 2010
#1
04-02-2010, 05:03 PM


Can you able to send me the project and implimentation details like abstract , base paper, existing system and proposed system
Reply
shoppingcart
Active In SP
**

Posts: 1
Joined: Sep 2010
#2
06-09-2010, 01:19 PM

please send the content for seminar and presentation on " predicting missing items in shopping carts"
Reply
seminarsonly
Active In SP
**

Posts: 126
Joined: Sep 2010
#3
06-09-2010, 04:49 PM

Predicting Missing Items in Shopping Carts
The Existing researchwork in association mining has focused mainly on how to expedite the search for frequently co-occurring groups of items inshopping cart type of transactions. But less attention has been paid to the use of these frequent itemsets for prediction purposes. In this article is described a method that uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy. itemset trees (IT-trees), a recently proposed data structure is used to obtain, in a computationally efficient manner, all rules whose antecedents contain at least one item from the incomplete shopping cart. Then these rules are combined by uncertainty processing techniques such as the classical Bayesian decision theory and a Dempster-Shafer (DS) theory of evidence combination based new algorithm.

for more details, visit this page:
ieeexplore.ieeesearch/freesrchabstract.jsp?tp=&arnumber=4693707&queryText%3Dpredicting+missing+items+in+shopping+carts%26openedRefinements%3D*%26searchField%3DSearch+All
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
Reply
seminar class
Active In SP
**

Posts: 5,361
Joined: Feb 2011
#4
28-02-2011, 10:51 AM


.doc   PREDICTING MISSING ITEMS IN SHOPPING CARTS.doc (Size: 39 KB / Downloads: 118)
PREDICTING MISSING ITEMS IN SHOPPING CARTS
Abstract:

Existing research in association mining has focused mainly on how to expedite the search for frequently co-occurring groups of items in “shopping cart” type of transactions; less attention has been paid to methods that exploit these “frequent itemsets” for prediction purposes. This paper contributes to the latter task by proposing a technique that uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy. Using the recently proposed data structure of itemset trees (IT-trees), we obtain, in a computationally efficient manner, all rules whose antecedents contain at least one item from the incomplete shopping cart. Then, we combine these rules by uncertainty processing techniques, including the classical Bayesian decision theory and a new algorithm based on the Dempster-Shafer (DS) theory of evidence combination.
Existing System:
If j is the item whose absence or presence is to be predicted, for a given itemset s, the technique identifies among the rules with antecedents subsumed by s those that have the highest precedence according to the reliability of the rules—this reliability is assessed based on the rules’ confidence and support values. The rule is then used for the prediction of j. The method suffers from three shortcomings. First, it is clearly not suitable in domains with many distinct items j. Second, the consequent is predicted based on the “testimony” of a single rule, ignoring the simple fact that rules with the same antecedent can imply different consequents—a method to combine these rules is needed. Third, the system may be sensitive to the subjective user-specified support and confidence thresholds.
An early attempt by Bayardo and Agrawal reports a method to convert frequent itemsets to rules. Some papers then suggest that a selected item can be treated as a binary class (absence! 0; presence! 1) whose value can be predicted by such rules. A user asks: does the current status of the shopping cart suggest that the customer will buy bread? If yes, how reliable is this prediction? Early attempts achieved promising results and some authors even observed that the classification performance of association mining systems may compare favorably with that of machine-learning techniques.
Some of these weaknesses are alleviated in, where a missing item is predicted in four steps. First, they use a so-called partitioned-ARM to generate a set of association rules (a ruleset). The next step prunes the ruleset (e.g., by removing redundant rules). From these, rules with the smallest distance from the observed incomplete shopping cart are selected. Finally, the items predicted by these rules are weighed by the rules’ antecedents’ similarity to the shopping cart.
Proposed System:
The mechanism reported in this paper focuses on one of the oldest tasks in association mining, based on incomplete information about the contents of a shopping cart, can we predict which other items the shopping cart contains? Our literature survey indicates that, while some of the recently published systems can be used to this end, their practical utility is constrained, for instance, by being limited to domains with very few distinct items. Bayesian classifier can be used too, but we are not aware of any systematic study of how it might operate under the diverse circumstances encountered in association mining.
We refer to our technique by the acronym DS-ARM. The underlying idea is simple: when presented with an incomplete list s of items in a shopping cart, our program first identifies all high-support, high-confidence rules that have as antecedent a subset of s. Then, it combines the consequents of all these (sometimes conflicting) rules and creates a set of items most likely to complete the shopping cart. Two major problems complicate the task: first, how to identify the relevant rules in a computationally efficient manner; second, how to combine (and quantify) the evidence of conflicting rules. We addressed the former issue by the recently proposed technique of IT-trees and the latter by a few simple ideas from the DS theory.
Modules:
• Login
Authentication
• Item selection
• Predicting Missing Items
• Decision making
• Adding to Shopping Cart
Hardware Requirements:
• Processor: Pentium IV or Above
• Hard Disk: 40GB or Above
• RAM: 512 or Above
Software Requirements:
• Operating System: Windows XP
• Front End: Asp.net
• Back End: SQL Server
Reply
seminar class
Active In SP
**

Posts: 5,361
Joined: Feb 2011
#5
12-03-2011, 04:48 PM

SUBMITED BY
K.MOHAN KUMAR
V.SUDHAKAR
M.RAMU KUMAR
N.P.AKHIL


.pptx   SUDAKER.pptx (Size: 111.62 KB / Downloads: 101)
ABSTRACT
Existing research in association with mining has focused mainly on how to expedite the search for frequently co-occurring groups of items in “shopping cart” type of transactions; less attention has been paid to methods that exploit these “frequent itemsets”for prediction purposes.
This project and implimentation contributes to the latter task by proposing a technique that uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy.
Using the recently proposed data structure of item set trees (IT-trees), we obtain, in a computationally efficient manner, all rules whose antecedents contain at least one item from the incomplete shopping cart.
This project and implimentation combine these rules by uncertainty processing techniques, including the classical Bayesian decision theory and a new algorithm based on the Dempster-Shafer (DS) theory of evidence combination.
Existing system:
Existing research in association mining has focused mainly on how to expedite the search for frequently co-occurring groups of items in “shopping cart” type of transactions; less attention has been paid to methods that exploit these “frequent itemsets”for prediction purposes.
Existing system Disadvantages:
They didn’t find missing items in frequently used item set.
couldn't find number of users per item set.
Time complexity
lack of viewing items to the user.
Proposed system:
*Finding missing items using apriority algorithms in frequently used item set.
*counting number of users per item set.
*calculating total number of visitor’s in our websites
Advantages of Proposed system:
Reducing time complexity. User can easily view the items set. *
Missing items can easily find in the item set.
Hardware Requirements
SYSTEM : Pentium IV 2.4 GHz
HARD DISK : 40 GB
FLOPPY DRIVE : 1.44 MB
MONITOR : 15 VGA colour
MOUSE : Logitech.
RAM : 256 MB
Software Requirements
Operating system :- Windows XP Professional
Front End : - VS.NET 2005
Coding Language :- Visual C# .Net
Back-End : - Sql Server 2000


Reply
ilapadhi
Active In SP
**

Posts: 1
Joined: Mar 2011
#6
13-03-2011, 01:42 PM

Hello Sir,
Pls let me share more about the predicting missing items in shopping cart as currently my Mtech thesis is on this for which I will be highly obliged to You.
Thanks and regards,
Ila
Reply
seminar class
Active In SP
**

Posts: 5,361
Joined: Feb 2011
#7
06-04-2011, 04:15 PM


Predicting Missing Items in Shopping Carts
Abstract:

Existing research in association mining has focused mainly on how to expedite the search for frequently co-occurring groups of items in “shopping cart” type of transactions; less attention has been paid to methods that exploit these “frequent itemsets” for prediction purposes. This paper contributes to the latter task by proposing a technique that uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy. Using the recently proposed data structure of itemset trees (IT-trees), we obtain, in a computationally efficient manner, all rules whose antecedents contain at least one item from the incomplete shopping cart. Then, we combine these rules by another technique called Bayesian decision theory to predict the mutually independent items. Finally we introduce a new algorithm based on the Dempster-Shafer (DS) theory of evidence combination which is combined with above techniques to perform well in prediction process.
Existing System:
The existing system focused only on frequently occurring items for prediction process. It uses itemsets trees data structures and rules combined with Bayesian decision theory to predict the mutually independent items. But this approach does not perform well.
Proposed System:
Our proposed system introduces Dempster-Shafer (DS) theory of evidence combination algorithm. DS theory still grow very fast with the average length of the transactions and with the number of distinct items in real world
applications.
List of Modules:
• Item tree generation.
• Rule generation mechanism.
• Bayesian approach.
• DS combination algorithm.
ITEM TREE GENERATION:
This module describes the generation of item sets. These item sets shows the available stock details. All the items are seperated based on their category. Here price,discount,quantity of each items can be maintained by administrator. Each item can be identified by separate item code.
Eg:
Items

Health drinks Sweets

Boost Complan Chocolates Milk sweets
RULE GENERATION MECHANISM:
The proposed rule generation algorithm makes use of the flagged item tree created from the training data set. The algorithm takes an incoming itemset as the input and returns a graph that defines the association rules entailed by the given incoming itemset.
To expedite the rule generation process, we use the Item tree approach that modifies the rule generation algorithm due to two reasons. First, the algorithm addresses a slightly different task, generating all rules of the form. Second, our goal is not to generate all association rules, but, rather, to build a predictor from a set of “effective” association rules.
BAYESIAN APPROACH:
The mathematically “clean” version is known to be computationally expensive in domains where many independent variables are present. Fortunately, this difficulty can be sidestepped by the so called Naive-Bayes principle that assumes that all variables are mutually pairwise conditionally independent.The process of identifying mutually independent items known as Bayesian decision theory.
DS COMBINATION ALGORITHM:
When searching for a way to predict the presence or absence of an item in a partially observed shopping cart, we wanted to use association rules. The question is how to combine the potentially conflicting evidence. One possibility is to rely on the Dempster-Shafer-based Association Rule Mining(DS-ARM) theory of evidence combination.
DS theory assigns to any set, a numeric value called a basic belief assignment (BBA) or mass that quantifies the evidence one has towards the proposition that the given attribute values. This process also provides Body of Evidence(BoE). This BoE describes what are all the evidences to predict the missing items.

Reply
seminar class
Active In SP
**

Posts: 5,361
Joined: Feb 2011
#8
07-04-2011, 03:10 PM

PRESENTED BY:
J.Kanyakumari,


.pptx   REVIEW.pptx (Size: 180.32 KB / Downloads: 68)
Predicting missing items in SHOPPINGCART
ABSTRACT

• Existing research in association with mining has focused mainly on how to expedite the search for frequently co-occurring groups of items in “shopping cart” type of transactions
• less attention has been paid to methods that exploit these “frequent itemsets”for prediction purposes.
• This project and implimentation contributes to the latter task by proposing a technique that uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy.
MODULES
ADMIN:-

The admin module contains all the details of the shopping complex. This module contains the items that are present and cost of the item related to the product.
User Details:
In this module the administrator of the organization is to create the new user. The new user has unique id and some confidential information. This information shared only by the admin and the corresponding user.
Item List:
In this module the administrator knows the details that the number of items present in the shopping carts and also able to know the details of missing items.
Reply
seminar tips
Super Moderator
******

Posts: 8,857
Joined: Oct 2012
#9
02-02-2013, 10:22 AM

to get information about the topic"predicting missing items in shopping carts" refer the link bellow

topicideashow-to-predicting-missing-item-in-shopping-carts

topicideashow-to-predicting-missing-item-in-shopping-carts?page=2

topicideashow-to-predicting-missing-items-in-shopping-carts
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  online shopping books spardha spoorthi one year Guest 1 68 31-10-2016, 02:51 PM
Last Post: amrutha735
  predicting missing items in shopping carts ppt Guest 1 34 31-10-2016, 12:03 PM
Last Post: anusree
  rfid based shopping trolley ppt Guest 1 55 11-10-2016, 03:17 PM
Last Post: amrutha735
  database on shopping mall management system in dbms Guest 1 59 08-10-2016, 09:51 AM
Last Post: amrutha735
  database on shopping mall management system in dbms Guest 2 63 01-07-2016, 11:58 AM
Last Post: Dhanabhagya
  problem definition for online shopping Guest 1 64 20-04-2016, 02:03 PM
Last Post: mkaasees
  rfid based shopping trolley ppt Guest 1 50 30-01-2016, 11:15 AM
Last Post: mkaasees
  vellore aunty and item number Guest 0 54 07-01-2016, 08:12 PM
Last Post: Guest
  source code for online shopping by using procedures functions in pl sql Guest 1 83 06-01-2016, 12:05 PM
Last Post: Guest
  uml diagrams for online jewellery shopping management system Guest 0 64 28-12-2015, 07:20 PM
Last Post: Guest