12.

Optimal Scheduling and Placement of Internet Banner Advertisements

13. Slices Mining Based on Singular Value
14. Study and Application of Web-based Data Mining in E-Business
15. Building Personalized Recommendation System in E-commerce Using Association Rule-based Mining and
Classification
16. Generalized Association Rule Mining Algorithms based on Data Cube
17. AWeb Service Mining Framework
18. Discovering new knowledge with advanced data mining tool
19. Applying Web Usage Mining Techniques to Discover Potential Browsing Problems of Users
20. Constructing a Web-based Employee Training Expert System with Data Mining Approach
21. Visually Mining the Datacube using a Pixel-Oriented Technique
22. A Hybrid and Efficient Scheme of Multicast Source Authentication
23. ACKDs: An Authenticated Combinatorial Key Distribution Scheme for Wireless Sensor Networks
24. Storage-Awareness: RFID Private Authentication based on Sparse Tree
25. Trapdoor-based Mutual Authentication Scheme without Cryptographic Primitives in RFID Tags
26. A mutual authentication and key exchange scheme from bilinear pairings for low power computing devices
27. Authenticated On-Demand Ad Hoc Routing Protocol without Pre-shared Key Distribution

Optimal Scheduling and Placement of Internet Banner Advertisements

The increasing popularity of the world wide web has made it an attractive medium for advertisers. As more
advertisers place internet advertisements (hereafter also called “ads”), it has become important for web site
owners to maximize revenue through the optimal selection and placement of these ads. Unlike most previous
research, we consider a hybrid pricing model where the price advertisers pay is a function of (i) the number of
exposures of the ad and (ii) the number of clicks on the ad. The problem is to find an ad schedule to maximize
web site revenue under a hybrid pricing model. We formulate two versions of the problem: static and dynamic,
and propose a variety of effcient solution techniques that provide near-optimal solutions. In the dynamic version,
the schedule of ads is changed based on individual user click behavior. We show – using a theoretical proof under
special circumstances and an experimental demonstration under general conditions – that a schedule that adapts
to user click behavior consistently outperforms one that does not. We also demonstrate that to benefit from
observing user click behavior, the associated probability parameter need not be estimated accurately. For both
these versions, we examine the sensitivity of the revenue with respect to the model parameters.

Slices Mining Based on Singular Value

Abstract - Slice is one of the major operations in on-line analysis processing which has played an important role in
the application of decision support. Based on data cube, by mining the maximum singular value of the slices, a
method was proposed in this paper to extract the inner rules of movement. Algebraic theories proved that it is
feasible. And the numerical experiment also demonstrated that it is efficient.

Study and Application of Web-based Data Mining in E-Business

Abstract - The paper is engaged in a discussion over applications of Web mining to the intelligent search engine,
customer relationship management, personalized service and commercial credit evaluation in e-business. And
analysis and reasoning of the mass of information in e-business are made by the technology of Web mining, which
can dig out potential modes and predict customers' action, to help enterprises’ decision-makers adjust their
marketing strategy, reduce the risk, make right decisions and get competitive advantage.

Building Personalized Recommendation System in E-commerce Using Association Rule-based Mining and
Classification

Abstract - Due to the convenience of Internet, people can search for whatever information they need and buy
whatever they want on the web. In the age of ECommerce, it is difficult to provide support for customers to find
the most valuable products that match their heterogeneous needs. Traditional approaches to this so-called
personalization problem adopt pre-defined formats to describe the customer requirements. This always leads to
distortion in eliciting requirement information and thus inaccurate recommendations. In this paper,we propose a
personalized recommendation system using association rule mining and classification in e-commerce. Customer
requirements are extracted from text documents and transformed into a set of significant phrases. Allowing the
transformed transaction records, a set of association rule are mined from database using Apriori algorithm. CBA-
CB algorithm is applied to produce the best rules out of the whole set of rules. The best classifiers are then
generated after the test and validation of those rules, aimed to predict the item labels for new customer
requirements and thus assigns the corresponding class labels to the customer. The system analysis and design of
the proposed recommendation system as well as the implementation of prototype are also presented.

3 Gathered By Prasanna Kumar Palepu kumarpalepu@gmail.com 0091-9884245698

Generalized Association Rule Mining Algorithms based on Data Cube

Abstract - This paper defined a kind of multi-dimension data cube model, and presented a new formalization of
generalized association rule based on data cube model. After comprehending the weaknesses of the current
generalized association rule mining algorithms based on data cube, we proposed a new algorithm GenHibFreq
which was suitable for mining multi-level frequent itemset based on data cube. By taking advantage of the item
taxonomy, algorithm GenHibFreq reduced the number of candidate itemsets counted, and had better efficiency. We
also designed an algorithm GenerateLHSs-Rule for generating generalized association rule from multi-level
frequent itemset. Demonstrated through examples, algorithms proposed in this paper had better efficiency and
less generated redundant rules than several existing mining algorithms, such as Cumulate, Stratify and ML_T2L1,
and had good performance in flexibility, scalability and complexity and had new ideas on conducting the
Generalized Association Rule Mining Algorithms in multi-dimension enviornment nad it also has great theroritical
meaning and practical value..

AWeb Service Mining Framework

Abstract - We propose a service mining framework for exploring interesting compositions of existing Web services.
The framework first screens Web services for composition leads using a “coarse-grained” filtering approach. It then
verifies these leads based on runtime conditions. Top candidates are selected from the verified leads and evaluated
for their interestingness. We present algorithms to automate the screening phase of the framework. Finally, we
study the effects of key variables on lead compositions’ interestingness. As a motivating example, we apply these
algorithms to the field of biological pathway discovery and rely on knowledge obtained from reverse engineering
online resources to assess their effectiveness.

Discovering new knowledge with advanced data mining tool

Abstract - In this paper we present the results of an intelligent analysis of database which was gathered during
elearning project called DISNET [1] in which a random sample of around 300 unemployed people collaborated. The
intelligent data analysis using advanced methods for decision tree construction was used in order to try to find the
main factors that influence a trainee’s progress in knowing how to use e-materials. We also analysed how trainee’s
gender influences on the usage of e-materials.

Applying Web Usage Mining Techniques to Discover Potential Browsing Problems of Users

Abstract - In this paper, a web usage mining based approach is proposed to discover potential browsing problems.
Two web usage mining techniques in the approach are introduced, including Automatic Pattern Discovery (APD)
and Co-occurrence Pattern Mining with Distance Measurement (CPMDM). A combination method is also discussed
to show how potential browsing problems can be identified

Constructing a Web-based Employee Training Expert System with Data Mining Approach

Abstract - Knowledge Management (KM) is an important strategy in business management and competition in 21st
century. Companies must manage their valuable knowledge and experience more aggressively to enhance
competitive advantage and human resource management (HRM). In this paper, we present a webbased training
system named ETES - Employee Training Expert System and the methodologies of its implementation. ETES
applied rule-based expert system technology to infer the learning type for employees. Moreover, ETES uses
association rule mining to find training strategies and learning map for personal learning. Besides, ETES provides
different training materials for employees according to their learning aptitudes, records and occupations. The
system has been tested and is now in pilot use by Teraauto Corporation which is a high-profits listed securities
company in Taiwan.

Visually Mining the Datacube using a Pixel-Oriented Technique

Abstract - This paper introduces a new technique easing the navigation and interactive exploration of huge
multidimensional datasets. Following the pixel-oriented paradigm [8], the key ingredients enabling the interactive
navigation of extreme volumes of data rely on a set of functions bijectively mapping data elements to screen
pixels. The use of the mapping from data elements to pixels constrain the computational complexity for the
rendering process to be linear with respect to the number of rendered pixels on the screen as opposed to the
dataset size. Our method furthermore allows the implementation of usual information visualization techniques
such as zoom and pan, anamorphosis and texturing. As a proof-of-concept, we show how our technique can be
adapted to interactively explore the Datacube, turning our approach into an efficient system for visual datamining.
We report experiments conducted on a Datacube containing 50 millions of items. To our knowledge, our technique
outperforms all existing ones and push the scalability limit close to the billion of elements. Supporting all basic
navigation techniques, and being moreover flexible makes it easily reusable for a large number of applications.
4 Gathered By Prasanna Kumar Palepu kumarpalepu@gmail.com 0091-9884245698
A Hybrid and Efficient Scheme of Multicast Source Authentication

Abstract - Source authentication is the most important and difficult problem in multicast security, and no schemes
can satisfy all multicast applications. So a Hybrid Multicast Source Authentication (HMSA) scheme was proposed
based on two data structures: hashing tree and hashing chain. Compared with some other schemes in
computation and communication overheads, HMSA is simple, efficient and secure.

ACKDs: An Authenticated Combinatorial Key Distribution Scheme for Wireless Sensor Networks

Abstract - In wireless sensor networks, sensor nodes generally cooperate with each other in collecting sensing
data and in-network processing according to the group communication model. Key distribution is at the heart of
secure group communications. In this paper, we present a scalable, efficient and authenticated scheme for group
key distribution. The proposed scheme is based on a combinatorial exclusion basis system (EBS) for efficiency and
oneway hash chains for authentication. It guarantees an authenticated group rekeying procedure and is efficient in
terms of storage, communication and computation overheads.

Storage-Awareness: RFID Private Authentication based on Sparse Tree

Abstract - As the growing use of Radio Frequency Identification (RFID) technology to enhance ubiquitous
computing environments, the privacy protection problem becomes a crucial issue. The objective of private
authentication for RFID systems is to allow valid readers explicitly authenticate their dominated tags without
leaking tags’ private information. To achieve strong privacy, recently, Lu et al. propose a Strong and lightweight
RFID Private Authentication protocol (SPA), which enables dynamic key-updating mechanism for balanced tree
based authentication approaches. However, due to its balanced tree structure, SPA is still susceptible to
compromising attacks. In this paper, we propose a Storage-Aware Private Authentication protocol (SAPA). This
scheme employs the sparse tree structure, and treats the path of each tag in the tree as an independent secret.
As a result, SAPA enjoys perfect privacy and largely reduces the space for storing key sequence on the side of the
tag, while keeping the key search complexity on the side of the reader still be logarithmic.

Trapdoor-based Mutual Authentication Scheme without Cryptographic Primitives in RFID Tags

Abstract - Radio Frequency IDentification(RFID) systems are being used in many applications such as the supply
chain. The widespread usage of tags creates new threats of security and privacy in RFID systems. Many schemes
have been proposed to provide security and privacy, based on basic cryptographic primitives such as hash function
and encryption algorithm. However, it may be a burden on a resource-constrained tag. As considering the
requirements on a tag, we propose a lightweight mutual authentication scheme based on trapdoor one-way
property and challenge/reaponse approach. Even though the proposed scheme does not perform cryptograhic
primitives, it guarantees security and privacy provided by the authentication schemes using cryptographic
primitives. We expect this mutual authentication scheme to activate RFID systems in various applications.

A mutual authentication and key exchange scheme from bilinear pairings for low power computing devices

Abstract - In a client-server network environment, a mutual authentication and key exchange scheme is an
important security mechanism to provide two parties with the property that they can authenticate each other’s
identity while they may construct a common session key. With rapid growth of mobile wireless networks, the
computational cost on the client side with low power computing devices is a critical factor of the security scheme
design. This paper presents a mutual authentication and key exchange scheme using bilinear pairings. Based on
the computational Diffie- Hellman assumption and the random oracle model, we show that the proposed scheme is
secure against passive attack, forgery attack and ID attack while it provides mutual authentication, implicit key
confirmation and partial forward secrecy. A performance analysis demonstrates that our scheme is well suited for
smart cards with limited computing capability.

Authenticated On-Demand Ad Hoc Routing Protocol without Pre-shared Key Distribution

Abstract - Ad hoc routing is a very fundamental operation on an ad hoc network, and hence it has been a main
target for an attacker to disrupt an ad hoc network. Therefore, not only secure communication among nodes but
also exchanging some special messages for the purpose of security operations, such as key exchange in ad hoc
networks, cannot help relying on the secure routing protocol. In this paper, we propose an authenticated on-
demand ad hoc routing protocol integrated with a key establishment protocol without pre-shared secret key
distribution among ad hoc nodes. The main advantage of the proposed protocol is that establishing a route and a
session key between a source and a destination node, when it is needed, can be performed simultaneously in
authenticated manner through the routing discovery protocol with no beforehand shared secret key. To achieve our
goal, we apply the notion of ID-based statically keyed authenticator to Dynamic Source Routing protocol, so the
proposed protocol does not require a public key certificate as well as pre-shared secret key distribution.
5 Gathered By Prasanna Kumar Palepu kumarpalepu@gmail.com 0091-9884245698