2. Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/1/7
Browse
26 results
Search Results
Item Quality driven web service selection and ranking(2008) D'Mello, D.A.; Ananthanarayana, V.S.The increasing number of Web service providers with numerous functionally similar or same Web services produced a new problem of choosing a suitable Web service for the requester based on his expectations. The Quality of Service (QoS) can be used to select and rank functionally similar Web services. In this paper we define four Web service provider qualities to distinguish functionally similar and qualitatively competitive Web services. The main objective of this paper is to explore the mechanism which breaks the tie that may arise among functionally similar and qualitatively equivalent (competitive) Web services during Web service selection and ranking. � 2008 IEEE.Item Prefix-Suffix trees: A novel scheme for compact representation of large datasets(2007) Pai, R.M.; Ananthanarayana, V.S.An important goal in data mining is to generate an abstraction of the data. Such an abstraction helps in reducing the time and space requirements of the overall decision making process. It is also important that the abstraction be generated from the data in small number of scans. In this paper we propose a novel scheme called Prefix-Suffix trees for compact storage of patterns in data mining, which forms an abstraction of the patterns, and which is generated from the data in a single scan. This abstraction takes less amount of space and hence forms a compact storage of patterns. Further, we propose a clustering algorithm based on this storage and prove experimentally that this type of storage reduces the space and time. This has been established by considering large data sets of handwritten numerals namely the OCR data, the MNIST data and the USPS data. The proposed algorithm is compared with other similar algorithms and the efficacy of our scheme is thus established. � Springer-Verlag Berlin Heidelberg 2007.Item Parallel method for discovering frequent itemsets using weighted tree approach(2009) Kumar, P.; Ananthanarayana, V.S.Every element of the transaction in a transaction database may contain the components such as item number, quantity, cost of the item bought and some other relevant information of the customer. Most of the association rules mining algorithms to discover frequent itemsets do not consider the components such as quantity, cost etc. In a large database it is possible that even if the itemset appears in a very few transactions, it may be purchased in a large quantity. Further, this may lead to very high profit. Therefore these components are the most important information and without which it may cause the lose of information. This motivated us to propose a parallel algorithm to discover all frequent itemsets based on the quantity of the item bought in a single scan of the database. This method achieves its efficiency by applying two new ideas. Firstly, transaction database is converted into an abstraction called Weighted Tree that prevents multiple scanning of the database during the mining phase. This data structure is replicated among the parallel nodes. Secondly, for each frequent item assigned to a parallel node, an item tree is constructed and frequent itemsets are mined from this tree based on weighted minimum support. � 2009 IEEE.Item EfficientTreeMiner: Mining frequent induced substructures from XML documents without candidate generation(2006) Santhi Thilagam, P.; Ananthanarayana, V.S.Tree structures are used extensively in domains such as XML databases, computational biology, pattern recognition, computer networks, web mining, multi-relational data mining and so on. In this paper, we present an EfficientTreeMiner, a computationally efficient algorithm that discovers all frequently occurring induced subtrees in a database of labeled rooted unordered trees. The proposed algorithm mines frequent subtrees without generating any candidate subtrees. Efficiency is achieved by compressing the large database into a condensed data structure, namely prefix string representation, which reduces space complexity and by adopting a Frequent Immediate Descendents method that avoids the costly generation of candidate sets. Experimental results show that our algorithm has less time complexity when compared to existing approaches and is also scalable for mining both long and short frequent subtrees. � 2006 IEEE.Item Efficient mining of frequent rooted continuous directed subgraphs(2006) Sreenivasa, G.J.; Ananthanarayana, V.S.Mining frequent rooted continuous directed (RCD) subgraphs is very useful in Web usage mining domain. We formulate the problem of mining RCD subgraphs in a database of rooted labeled continuous directed graphs. We propose a novel approach of merging like RCD subgraphs. This approach builds a Pattern Super Graph (PSG) structure. This PSG is a compact structure and ideal for extracting frequent patterns in the form of RCD subgraphs. The PSG based mine avoids costly, repeated database scans and there is no generation of candidates. Results obtained are appreciating the approach proposed. � 2006 IEEE.Item Effective web service discovery based on functional semantics(2009) D'Mello, D.A.; Ananthanarayana, V.S.Web service discovery is a mechanism which facilitates an access to the Web service descriptions. UDDI facilitates the discovery based on the service functionality through keyword and category matching. Such discovery techniques do not consider the semantics and user context as they are too syntactic in nature. In this paper, we propose a well formed functional semantics to describe an operation of a Web service. We design the extendible functional knowledge to map the requested or published operation descriptions into an abstract operation. The experimentation shows that, the proposed functional semantics based discovery mechanism has better performance in terms of precision and recall. � 2009 IEEE.Item Challenges (research issues) in web services(2010) D'Mello, D.A.; Ananthanarayana, V.S.; Narasimhan, V.L.The Web services paradigm promises to enable rich, flexible and dynamic inter-operation of highly distributed and heterogeneous applications using Web standards. The ability to discover, select and compose inter-organizational and heterogeneous services available on the Web at runtime in order to facilitate application reuse is an interesting problem in Web services. An effective mechanism for discovery, selection and composition of Web services, based on the requester's complex functional and nonfunctional requirements is still an issue of open research. In this paper, authors explore the major Challenges (open problems) related to Web service description, discovery, selection and compositions. � 2010 IEEE.Item Discovery of weighted association rules mining(2010) Kumar, P.; Ananthanarayana, V.S.Mining of association rules for basket databases, has been investigated by [1] [3] [4], [9], [12], etc. Most of these works focus on mining binary association rules, i.e, most of the association rules mining algorithms to discover frequent itemsets do not consider the quantity in which items have been purchased. This paper discusses an efficient method for discovering a weighted association rules from a large volumes of data in a single scan of the database. The data structure used here is called Weighted Tree. We found that this algorithm is more efficient than Cai's Algorithm. �2010 IEEE.Item Business offer driven dynamic web service selection(2008) D?Mello, D.A.; Ananthanarayana, V.S.; Achar, R.In today's business environment, the business offers have an inevitable importance in giving the buyer the most profitable deal. In order to improve the business, the service providers attract the customers by advertising a lot of attractive offers. There is a need for the selection mechanism which accepts the requester's various requirements on business offers to find the most profitable service. In this paper, we identify various business offers of service providers in e-business domain and broadly classify them based on requester's point of view as, unconditional business offers, conditional business offers and probabilistic business offers. We also provide a vocabulary for various business offers of service providers. The paper explores different types of requester's requirements on business offers and proposes a language to express such requirements on various business offers. We propose a tree structure to represent requester's complex business offer requirements for the business offer driven Web service selection.Item Delivering LBA with LBS using service-oriented architecture(2012) D'Souza, M.; Ananthanarayana, V.S.Location-Based Advertising (LBA) is the most happening and latest thing in the marketing process. LBA provides advertisements (ads) based on the mobile user's current geographic position. LBA becomes more effective when advertisements are made available to mobile users according to their choice and taste. This paper covers a simple pull based LBA system which is integrated with a Service-Oriented Architecture (SOA) based Location-Based Services (LBS) system. This system is implemented using open standards based Web services technology which supports dynamic discovery and interoperability. This is a special kind of system which allows service providers to publish both services and their advertisements together at one place. The proposed system is demonstrated using a restaurant finder mobile application. � 2012 IEEE.
- «
- 1 (current)
- 2
- 3
- »