{"title":"Web site visitor classiflcation using machine learning","authors":"P. Defibaugh-Chavez, Srinivas Mukkamala, A. Sung","doi":"10.1109/ICHIS.2004.93","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.93","url":null,"abstract":"Classifying Web site visitors allows organizations to present customized content and effectively allocate resources. Traditional methods of visitor classification involve tracking individual users over many sessions via a unique identifier such as the IP address or a cookie. These methods are either too general or strip the visitor of a level of privacy. In this paper we use machine learning techniques to classify visitors of a data-centric Web site using a minimal amount of information and without a unique identifier. We are able to group visitors into groups without extended user tracking.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123331499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"K-ranked covariance based missing values estimation for microarray data classification","authors":"M. Sehgal, I. Gondal, L. Dooley","doi":"10.1109/ICHIS.2004.67","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.67","url":null,"abstract":"Microarray data often contains multiple missing genetic expression values that degrade the performance of statistical and machine learning algorithms. This paper presents a K-ranked diagonal covariance-based missing value estimation algorithm (KRCOV) that has demonstrated significantly superior performance compared to the more commonly used K-nearest neighbour (KNN) imputation algorithm when it is applied to estimate missing values of BRCA1, BRCA2 and sporadic genetic mutation samples present in ovarian cancer. Experimental results confirm KRCOV outperformed both KNN and zero imputation techniques in terms of their classification accuracies when used to impute randomly missing values from 1% to 5%. The classifier used for this purpose was the generalized regression neural network. The paper also provides a hypothesis for why KRCOV performs better than KNN not only for bio informatics data but also for other data types having strong correlated values.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128730379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance studies on KBANN","authors":"R. Bose, G. Nagaraja","doi":"10.1109/ICHIS.2004.74","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.74","url":null,"abstract":"Hybrid models combining the analytical (rule-based) and connectionist (artificial neural network (ANN)) paradigms are called knowledge based neural networks (KBNN). The knowledge based artificial neural network (KBANN) is one such model that makes use of the domain theory represented as propositional rules and training examples. In this article, we analyze the performance of KBANN and suggest some ideas of improving its capabilities. A study on the effect of inductive bias on KBANN, use of adaptive learning algorithms instead of the standard backpropagation to improve the training times and the use of regularization methods for improving generalization performance is presented. It is shown that for better performance, the initial weight assignment to links obtained by domain theory varies with the domain and the performance of KBANN is improved by using regularization methods like the weight decay along with Rprop training algorithm instead of the standard backpropagation.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128237805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new blind deconvolution algorithm based on a gradient method with phase spectral constraints","authors":"E. Uchino, N. Suetake, M. Sakano","doi":"10.1109/ICHIS.2004.7","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.7","url":null,"abstract":"A new blind deconvolution method with additional phase spectral constraints for the blurred image is discussed in this paper. The blurred image is a convolution of an original image and a point-spread function (PSF). The proposed method is based on the following iterative procedures, i.e., a projection onto a frequency space satisfying phase spectrum constraints, a minimization of a cost function and a projection onto an image space satisfying the support and nonnegativity constraints. This method restores the original image and the PSF stably with high accuracy. The effectiveness of the proposed method is verified by applying it to some blind deconvolution problems of images. The experimental results show that the performance of the proposed method is drastically improved in comparison with the conventional blind deconvolution method.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124017671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cooperative game theory within multi-agent systems for systems scheduling","authors":"D. Messie, J. Oh","doi":"10.1109/ICHIS.2004.35","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.35","url":null,"abstract":"Research concerning organization and coordination within multi-agent systems continues to draw from a variety of architectures and methodologies. The work presented in this paper combines techniques from game theory and multi-agent systems to produce self-organizing, polymorphic, lightweight, embedded agents for systems scheduling within a large-scale real-time systems environment. Results show how this approach is used to experimentally produce optimum real-time scheduling through the emergent behavior of thousands of agents. These results are obtained using a SWARM simulation of systems scheduling within a high energy physics experiment consisting of 2500 digital signal processors.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"16 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132436299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A rationality-based modeling for coalition support","authors":"J. Oh, N. Gemelli, R. Wright","doi":"10.1109/ICHIS.2004.12","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.12","url":null,"abstract":"We present a game theoretic model for multi-agent resource distribution and allocation where agents in the environment must help each other to survive. Each agent maintains a set of two-tuples T=(A, P) called friendship values representing actual friendship and perceived friendship. The model directly addresses problems in reputation management schemes in multi-agent systems and peer-to-peer distributed systems. We present algorithms for maintaining the friendship values as well as a utility equation used in each agent's decision making. For an application problem, we adapted our formal model to the military coalition support problem in peace-keeping missions. Simulation results show that efficient resource allocation and sharing with minimum communication cost is achieved without centralized control.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"2000 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132702790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Feature selection and classification of gene expression profile in hereditary breast cancer","authors":"M. Raza, I. Gondal, D. Green, R. Coppel","doi":"10.1109/ICHIS.2004.44","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.44","url":null,"abstract":"Correct classification and prediction of tumor cells is essential for successful diagnosis and reliable future treatment. However, it is very challenging to distinguish between tumor classes using microarray with thousands of gene expressions. Removing irrelevant genes is very helpful for us to learn the relationship between genes and tumors. In this paper we have used two methods: multivariate permutation test (MPT) and significant analysis of microarray (SAM) to select significant genes for feature selection. Using those selected features, we applied support vector machine, (SVM) with polynomial, radial and linear kernels, to predict the class of testing data. Our result shows that all the samples are classified correctly. We have achieved 100% accuracy in classification among all the samples with polynomial kernel of SVM while Liner kernel shows no misclassification among BRCA1-BRCA2 and BRCA1-sporadic.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133162745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new sparse rule-based fuzzy reasoning method","authors":"Baowen Wang, Xia Li, Wenyuan Liu, Yan Shi","doi":"10.1109/ICHIS.2004.9","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.9","url":null,"abstract":"This paper presents a new fuzzy interpolative reasoning method in the sparse fuzzy rule bases based on so-called similarity relations of fuzzy sets. By this reasoning method, an inference consequence can be simply obtained, and is a normal and convex fuzzy set without any limitation, which shows the potential ability of the proposed method in real-world fuzzy applications.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133719702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Artificial neural networks applied to long-term electricity demand forecasting","authors":"M. Mamun, K. Nagasaka","doi":"10.1109/ICHIS.2004.27","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.27","url":null,"abstract":"The electric power demand in Japan has steadily increased and the load factor of total power system has decreased. It is therefore very important to the utilities to have advance knowledge of their electrical load. One of the important points for forecasting the long-term load in Japan is to take into account the past and present economic situations and power demand. These points were considered in this study. The proposed artificial neural network (ANN) that is radial basis function network (RBFN) has also showed that the changes in loads are a reflection of economy. Here, prediction of peak loads in Japan up to year 2015 is discussed using the RBFN and the maximum demands for 2001 through 2015 are predicted to be elevated from 179.42 GW to 209.18 GW. The annual average rate of load growth seen per ten years until 2015 is about 1.39%.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124201910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
N. Fanizzi, S. Ferilli, L. Iannone, I. Palmisano, G. Semeraro
{"title":"Downward refinement in the ALN description logic","authors":"N. Fanizzi, S. Ferilli, L. Iannone, I. Palmisano, G. Semeraro","doi":"10.1109/ICHIS.2004.39","DOIUrl":"https://doi.org/10.1109/ICHIS.2004.39","url":null,"abstract":"We focus on the problem of specialization in a description logics (DL) representation, specifically the ALN language. Standard approaches to learning in these representations are based on bottom-up algorithms that employ the lcs operator, which, in turn, produces overly specific (overfitting,) and still redundant concept definitions. In the dual (top-down) perspective, this issue can be tackled by means of an ILP downward operator. Indeed, using a mapping from DL descriptions onto a clausal representation, we define a specialization operator computing maximal specializations of a concept description on the grounds of the available positive and negative examples.","PeriodicalId":274073,"journal":{"name":"Fourth International Conference on Hybrid Intelligent Systems (HIS'04)","volume":"493 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116197771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}