首页 > 最新文献

5th International Conference on Intelligent Systems Design and Applications (ISDA'05)最新文献

英文 中文
Pattern classification with incremental class learning and Hidden Markov models 基于增量类学习和隐马尔可夫模型的模式分类
Filip Lukaszewski, K. Nagorko
Incremental class learning - Hidden Markov models (ICL-HMM) system combines two different approaches adopted in pattern recognition area to form a new, robust solution. Our system is composed of two parts - ICL feature extractor and HMM sequence recognizer. The former, ICL, is an artificial neural network capable of incrementally learning to recognize features of patterns from a narrow window sliding over them. HMMs simulate systems that transfer from one hidden state to another. In every state the system generates some observations. In our system we train one HMM for every class of patterns by presenting to it the sequences of observations generated by ICL for patterns belonging to its class. In the testing phase, every HMM checks how well it models the sequence of observations generated for an unknown pattern. We present promising results of applying ICL-HMM system to printed Latin character recognition task.
增量类学习-隐马尔可夫模型(ICL-HMM)系统结合了模式识别领域采用的两种不同方法,形成了一种新的鲁棒解决方案。该系统由两个部分组成:ICL特征提取器和HMM序列识别器。前者,ICL,是一种人工神经网络,能够通过滑动的窄窗口逐步学习识别模式的特征。hmm模拟从一个隐藏状态转移到另一个隐藏状态的系统。在每个状态下,系统都会产生一些观测值。在我们的系统中,我们通过将ICL为属于其类别的模式生成的观察序列呈现给它,为每一类模式训练一个HMM。在测试阶段,每个HMM都会检查它对为未知模式生成的观察序列的建模效果。我们将ICL-HMM系统应用于印刷拉丁字符识别任务中,取得了令人满意的结果。
{"title":"Pattern classification with incremental class learning and Hidden Markov models","authors":"Filip Lukaszewski, K. Nagorko","doi":"10.1109/ISDA.2005.76","DOIUrl":"https://doi.org/10.1109/ISDA.2005.76","url":null,"abstract":"Incremental class learning - Hidden Markov models (ICL-HMM) system combines two different approaches adopted in pattern recognition area to form a new, robust solution. Our system is composed of two parts - ICL feature extractor and HMM sequence recognizer. The former, ICL, is an artificial neural network capable of incrementally learning to recognize features of patterns from a narrow window sliding over them. HMMs simulate systems that transfer from one hidden state to another. In every state the system generates some observations. In our system we train one HMM for every class of patterns by presenting to it the sequences of observations generated by ICL for patterns belonging to its class. In the testing phase, every HMM checks how well it models the sequence of observations generated for an unknown pattern. We present promising results of applying ICL-HMM system to printed Latin character recognition task.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121270650","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}
引用次数: 3
Adapting particle swarm optimization to stock markets 粒子群算法在股票市场中的应用
J. Nenortaite, R. Simutis
The paper is focused on the development of intelligent decision-making model which is based on the application of artificial neural networks (ANN) and swarm intelligence algorithm. The proposed model generates one-step forward investment decisions. The ANN are used to make the analysis of historical stock returns and to calculate one day forward possible profit, which could be get while following the model proposed decisions concerning the purchase of the stocks. Subsequently the particle swarm optimization (PSO) algorithm is applied for training of ANN. The training of ANN is made through the adjustment of all ANN towards the weights of "global best" ANN. The experimental investigations were made considering different forms of decision-making model: different structure ANN, input variables etc. The paper introduces experimental investigation for the evaluation of decision-making model. The experimental results show that the application of the proposed decision-making model lets to achieve better results than the average of the market.
本文主要研究了基于人工神经网络和群体智能算法的智能决策模型的开发。所建议的模型产生一步前的投资决策。利用人工神经网络对历史股票收益进行分析,并计算未来一天可能获得的利润,这可能是在遵循模型提出的购买股票的决策时获得的。随后,将粒子群优化算法应用于人工神经网络的训练。神经网络的训练是通过将所有神经网络的权重调整到“全局最优”神经网络来完成的。实验研究了不同形式的决策模型:不同结构的人工神经网络、输入变量等。本文介绍了对决策模型评价的实验研究。实验结果表明,应用所提出的决策模型可以取得优于市场平均水平的结果。
{"title":"Adapting particle swarm optimization to stock markets","authors":"J. Nenortaite, R. Simutis","doi":"10.1109/ISDA.2005.17","DOIUrl":"https://doi.org/10.1109/ISDA.2005.17","url":null,"abstract":"The paper is focused on the development of intelligent decision-making model which is based on the application of artificial neural networks (ANN) and swarm intelligence algorithm. The proposed model generates one-step forward investment decisions. The ANN are used to make the analysis of historical stock returns and to calculate one day forward possible profit, which could be get while following the model proposed decisions concerning the purchase of the stocks. Subsequently the particle swarm optimization (PSO) algorithm is applied for training of ANN. The training of ANN is made through the adjustment of all ANN towards the weights of \"global best\" ANN. The experimental investigations were made considering different forms of decision-making model: different structure ANN, input variables etc. The paper introduces experimental investigation for the evaluation of decision-making model. The experimental results show that the application of the proposed decision-making model lets to achieve better results than the average of the market.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115564305","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}
引用次数: 22
Modern control approach for robotic wheelchair with inverse pendulum control 轮椅机器人倒摆控制的现代控制方法
Yoshihiko Takahashi, O. Tsubouchi
We are proposing a robotic wheelchair that enables a wheelchair bound person to climb over steps up to about 8 cm in height without assistance from others. By using the proposed robotic wheelchair, a user can maintain inverse pendulum control after raising its front wheels. Then, a user can move forward to the step maintaining the inverse pendulum control, and can climb over the step using motor force of a rear wheel shaft. This paper described the control system designs and simulations of the inverse pendulum control. An observer based optimal control (LQG or H/sub 2/) with an integral action is discussed in order to obtain better control performances for the inverse pendulum control.
我们正在设计一种机器人轮椅,它能让坐轮椅的人在没有别人帮助的情况下爬过大约8厘米高的台阶。通过使用所提出的机器人轮椅,使用者可以在抬起前轮后保持倒摆控制。然后,用户可以保持倒摆控制向前移动到台阶上,并利用后轮轴的电机力爬过台阶。本文介绍了倒立摆控制系统的设计和仿真。讨论了一种基于观测器的最优控制(LQG或H/sub / 2/)的积分控制方法,以获得较好的控制性能。
{"title":"Modern control approach for robotic wheelchair with inverse pendulum control","authors":"Yoshihiko Takahashi, O. Tsubouchi","doi":"10.1109/ISDA.2005.67","DOIUrl":"https://doi.org/10.1109/ISDA.2005.67","url":null,"abstract":"We are proposing a robotic wheelchair that enables a wheelchair bound person to climb over steps up to about 8 cm in height without assistance from others. By using the proposed robotic wheelchair, a user can maintain inverse pendulum control after raising its front wheels. Then, a user can move forward to the step maintaining the inverse pendulum control, and can climb over the step using motor force of a rear wheel shaft. This paper described the control system designs and simulations of the inverse pendulum control. An observer based optimal control (LQG or H/sub 2/) with an integral action is discussed in order to obtain better control performances for the inverse pendulum control.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123399385","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}
引用次数: 17
Changeability of Web objects - browser perspective Web对象的可变性——浏览器透视图
A. Sieminski
The paper examines the usefulness of the browser cache for studying the properties of Web objects. The cache contains detailed, personalized data on a user interaction with the Web during the period covering a few previous weeks. The data could be used for a variety of purposes including adaptive systems but the paper concentrates on the objects' changeability. Precise knowledge about the scope and nature of the changeability enables us to estimate the upper limit of caching efficiency, no matter what algorithms are used. Caching reduces both the volume of the traffic and the perceived latency. The paper discusses the results of an experiment and suggests other areas in which the data extracted from the local Internet buffer may be useful.
本文考察了浏览器缓存在研究Web对象属性方面的作用。缓存包含了用户在过去几周内与Web交互的详细的个性化数据。这些数据可以用于各种目的,包括自适应系统,但本文主要关注对象的可变性。对可变性的范围和性质的精确了解使我们能够估计缓存效率的上限,无论使用什么算法。缓存既减少了通信量,也减少了感知到的延迟。本文讨论了一个实验的结果,并提出了从本地互联网缓冲区中提取数据可能有用的其他领域。
{"title":"Changeability of Web objects - browser perspective","authors":"A. Sieminski","doi":"10.1109/ISDA.2005.32","DOIUrl":"https://doi.org/10.1109/ISDA.2005.32","url":null,"abstract":"The paper examines the usefulness of the browser cache for studying the properties of Web objects. The cache contains detailed, personalized data on a user interaction with the Web during the period covering a few previous weeks. The data could be used for a variety of purposes including adaptive systems but the paper concentrates on the objects' changeability. Precise knowledge about the scope and nature of the changeability enables us to estimate the upper limit of caching efficiency, no matter what algorithms are used. Caching reduces both the volume of the traffic and the perceived latency. The paper discusses the results of an experiment and suggests other areas in which the data extracted from the local Internet buffer may be useful.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115646552","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}
引用次数: 14
Distributed service-oriented architecture for information extraction system "Semanta" 面向服务的分布式信息抽取系统“Semanta”体系结构
Lukasz Jastrzebski, Maciej Piasecki, Grzegorz Strzelecki
Our objective is to provide a flexible, scalable, distributed architecture that assures a high performance for information extraction (IE) systems working in Internet. The architecture is based on both the general paradigm of the service-oriented architecture, client-server approach and strong separation of concerns between storage and processing components. An experimental IE system, named Semanta, utilising the proposed architecture is also presented. In the following document, we describe five main Semanta services, which are Web user interface (WebUI), Web crawler service (WCS), parsing service (PS), IE service and manager
我们的目标是提供一个灵活的、可扩展的、分布式的体系结构,以保证在Internet上工作的信息提取(IE)系统的高性能。该体系结构基于面向服务的体系结构的通用范例、客户机-服务器方法以及存储和处理组件之间的强烈关注点分离。本文还介绍了一个基于该架构的实验性IE系统Semanta。在下面的文档中,我们描述了五个主要的语义服务,它们是Web用户界面(Web ui)、Web爬虫服务(WCS)、解析服务(PS)、IE服务和管理器
{"title":"Distributed service-oriented architecture for information extraction system \"Semanta\"","authors":"Lukasz Jastrzebski, Maciej Piasecki, Grzegorz Strzelecki","doi":"10.1109/ISDA.2005.39","DOIUrl":"https://doi.org/10.1109/ISDA.2005.39","url":null,"abstract":"Our objective is to provide a flexible, scalable, distributed architecture that assures a high performance for information extraction (IE) systems working in Internet. The architecture is based on both the general paradigm of the service-oriented architecture, client-server approach and strong separation of concerns between storage and processing components. An experimental IE system, named Semanta, utilising the proposed architecture is also presented. In the following document, we describe five main Semanta services, which are Web user interface (WebUI), Web crawler service (WCS), parsing service (PS), IE service and manager","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"29 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114050453","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}
引用次数: 1
Automatic classification of singing voice quality 歌唱音质自动分类
B. Kostek, Pawel Zwan
In the paper problems related to the classification of singing voice quality are presented. For this purpose a database consisting of singers' sample recordings is constructed and parameters are extracted from recorded voice of trained and untrained singers. The parameterization process is based on both voice source and formant analysis of a singing voice. These parameters are explained as to their physical interpretation and analyzed statistically in order to diminish their number. The statistical analysis is based on the Fisher statistic. In such a way a feature vector of a singing voice is formed. Decision systems based on neutral networks and rough sets are utilized in the context of the voice type and voice quality classification. Results obtained in the automatic classification performed by both decision systems are compared. A possibility to classify automatically type/quality of voice is judged. The methodology proposed provides means for discerning trained and untrained singers.
本文提出了歌唱音质分类的相关问题。为此,构建了一个由歌手样本录音组成的数据库,并从训练有素和未训练的歌手录制的声音中提取参数。参数化过程是基于嗓音的声源和共振分析。对这些参数进行物理解释和统计分析,以减少它们的数量。统计分析基于费雪统计量。这样就形成了歌唱声音的特征向量。基于神经网络和粗糙集的决策系统被用于语音类型和语音质量分类。比较了两种决策系统自动分类的结果。判断自动分类语音类型/质量的可能性。所提出的方法为辨别训练有素和未经训练的歌手提供了手段。
{"title":"Automatic classification of singing voice quality","authors":"B. Kostek, Pawel Zwan","doi":"10.1109/ISDA.2005.28","DOIUrl":"https://doi.org/10.1109/ISDA.2005.28","url":null,"abstract":"In the paper problems related to the classification of singing voice quality are presented. For this purpose a database consisting of singers' sample recordings is constructed and parameters are extracted from recorded voice of trained and untrained singers. The parameterization process is based on both voice source and formant analysis of a singing voice. These parameters are explained as to their physical interpretation and analyzed statistically in order to diminish their number. The statistical analysis is based on the Fisher statistic. In such a way a feature vector of a singing voice is formed. Decision systems based on neutral networks and rough sets are utilized in the context of the voice type and voice quality classification. Results obtained in the automatic classification performed by both decision systems are compared. A possibility to classify automatically type/quality of voice is judged. The methodology proposed provides means for discerning trained and untrained singers.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121703449","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}
引用次数: 5
Unsupervised clustering using self-optimizing neural networks 使用自优化神经网络的无监督聚类
A. Horzyk
Self-optimizing neural networks (SONNs) are very effective in solving different classification tasks. They have been successfully used to many different problems. The classical SONN adaptation process has been defined as supervised. This paper introduces a new very interesting SONN feature - the unsupervised clustering ability. The unsupervised SONNs (US-SONNs) are able to find out most differentiating features for some training data and recursively divide them into subgroups. US-SONNs can also characterize the importance of features differentiating these groups. The division of the data is recursively performed till the data in subgroups differ imperceptibly. The SONN clustering proceeds very fast in comparison to other unsupervised clustering methods.
自优化神经网络(SONNs)在解决各种分类任务方面非常有效。他们已经成功地适应了许多不同的问题。经典的SONN自适应过程被定义为有监督的。本文引入了一种新的非常有趣的SONN特征——无监督聚类能力。无监督SONNs (US-SONNs)能够找出一些训练数据的最大区别特征,并递归地将它们划分为子组。US-SONNs还可以描述区分这些群体的特征的重要性。递归地对数据进行划分,直到子组中的数据差异难以察觉。与其他无监督聚类方法相比,SONN聚类进行得非常快。
{"title":"Unsupervised clustering using self-optimizing neural networks","authors":"A. Horzyk","doi":"10.1109/ISDA.2005.95","DOIUrl":"https://doi.org/10.1109/ISDA.2005.95","url":null,"abstract":"Self-optimizing neural networks (SONNs) are very effective in solving different classification tasks. They have been successfully used to many different problems. The classical SONN adaptation process has been defined as supervised. This paper introduces a new very interesting SONN feature - the unsupervised clustering ability. The unsupervised SONNs (US-SONNs) are able to find out most differentiating features for some training data and recursively divide them into subgroups. US-SONNs can also characterize the importance of features differentiating these groups. The division of the data is recursively performed till the data in subgroups differ imperceptibly. The SONN clustering proceeds very fast in comparison to other unsupervised clustering methods.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116631656","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}
引用次数: 6
A city guide agent creating and adapting individual sightseeing tours 创建和调整个人观光旅游的城市导游代理
Klaus ten Hagen, Marko Modsching, R. Kramer
Tourists deciding to explore a destination spontaneously and unprepared will have to walk and search on their own. This kind of investigation can be very uncomfortable as it often ends up in disarrangement. With today's agent technology, tourists can have their own intelligent guide taking care of the whole tour organization and execution in time. This is the main objective of the dynamic tour guide (DTG) - a mobile agent that selects attractions, plans an individual tour, provides navigational guidance and offers location based interpretation. Over all it consistently adapts the tour to a tourist's specific behavior in order to provide any possible support via a mobile device.
决定自发探索一个目的地的游客,在没有准备的情况下,将不得不自己步行和搜索。这种调查可能会非常不舒服,因为它经常以混乱告终。在今天的代理技术下,游客可以拥有自己的智能导游,及时负责整个旅游的组织和执行。这是动态导游(DTG)的主要目标——一个选择景点、计划个人旅行、提供导航指导和基于位置的解释的移动代理。总的来说,它始终根据游客的具体行为调整旅游,以便通过移动设备提供任何可能的支持。
{"title":"A city guide agent creating and adapting individual sightseeing tours","authors":"Klaus ten Hagen, Marko Modsching, R. Kramer","doi":"10.1109/ISDA.2005.5","DOIUrl":"https://doi.org/10.1109/ISDA.2005.5","url":null,"abstract":"Tourists deciding to explore a destination spontaneously and unprepared will have to walk and search on their own. This kind of investigation can be very uncomfortable as it often ends up in disarrangement. With today's agent technology, tourists can have their own intelligent guide taking care of the whole tour organization and execution in time. This is the main objective of the dynamic tour guide (DTG) - a mobile agent that selects attractions, plans an individual tour, provides navigational guidance and offers location based interpretation. Over all it consistently adapts the tour to a tourist's specific behavior in order to provide any possible support via a mobile device.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121238014","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}
引用次数: 36
An intelligent knowledge sharing strategy featuring item-based collaborative filtering and case based reasoning 一种基于项目协同过滤和基于案例推理的智能知识共享策略
Zeina Chedrawy, S. Abidi
In this paper, we propose a new approach for combining item-based collaborative filtering (CF) with case based reasoning (CBR) to pursue personalized information filtering in a knowledge sharing context. Functionally, our personalized information filtering approach allows the use of recommendations by peers with similar interests and domain experts to guide the selection of information deemed relevant to an active user's profile. We apply item-based similarity computation in a CF framework to retrieve N information objects based on the user's interests and recommended by peer. The N information objects are then subjected to a CBR based compositional adaptation method to further select relevant information objects from the N retrieved past cases in order to generate a more fine-grained recommendation.
本文提出了一种将基于项目的协同过滤(CF)与基于案例的推理(CBR)相结合的方法来实现知识共享环境下的个性化信息过滤。从功能上讲,我们的个性化信息过滤方法允许使用具有相似兴趣的同行和领域专家的推荐来指导选择与活跃用户的个人资料相关的信息。我们在CF框架中应用基于项目的相似性计算,根据用户的兴趣和同伴推荐检索N个信息对象。然后使用基于CBR的组合适应方法,从检索到的N个过去案例中进一步选择相关的信息对象,以生成更细粒度的推荐。
{"title":"An intelligent knowledge sharing strategy featuring item-based collaborative filtering and case based reasoning","authors":"Zeina Chedrawy, S. Abidi","doi":"10.1109/ISDA.2005.22","DOIUrl":"https://doi.org/10.1109/ISDA.2005.22","url":null,"abstract":"In this paper, we propose a new approach for combining item-based collaborative filtering (CF) with case based reasoning (CBR) to pursue personalized information filtering in a knowledge sharing context. Functionally, our personalized information filtering approach allows the use of recommendations by peers with similar interests and domain experts to guide the selection of information deemed relevant to an active user's profile. We apply item-based similarity computation in a CF framework to retrieve N information objects based on the user's interests and recommended by peer. The N information objects are then subjected to a CBR based compositional adaptation method to further select relevant information objects from the N retrieved past cases in order to generate a more fine-grained recommendation.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116152761","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}
引用次数: 16
Sequential classification of probabilistic independent feature vectors by mixture models 基于混合模型的概率独立特征向量顺序分类
T. Walkowiak
The paper presents methods of sequential classification with predefined classes. The classification is based on a sequence, assumed to be probabilistic independent, of feature vectors extracted from signal generated by the object. Each feature vector is a base for calculation of a probability density function for each predefined class. The density functions are estimated by the Gaussian mixture model (GMM) and the t-student mixture model. The model parameters are estimated by algorithms based on the expectation-maximization (EM) method. The estimated densities calculated for a sequence of feature vectors are inputs to analyzed classification rules. These rules are derived from Bayes decision theory with some heuristic modifications. The performance of the proposed rules was tested in an automatic, text independent, speaker identification task. Achieved results are presented.
本文提出了具有预定义类的顺序分类方法。分类是基于从目标产生的信号中提取的特征向量序列,假设是概率独立的。每个特征向量是计算每个预定义类的概率密度函数的基。密度函数由高斯混合模型(GMM)和t-student混合模型估计。采用基于期望最大化(EM)的算法对模型参数进行估计。对一组特征向量计算出的估计密度作为分析分类规则的输入。这些规则是在贝叶斯决策理论的基础上进行一些启发式修改而来的。在一个自动、文本独立的说话人识别任务中测试了所提出规则的性能。介绍了取得的成果。
{"title":"Sequential classification of probabilistic independent feature vectors by mixture models","authors":"T. Walkowiak","doi":"10.1109/ISDA.2005.81","DOIUrl":"https://doi.org/10.1109/ISDA.2005.81","url":null,"abstract":"The paper presents methods of sequential classification with predefined classes. The classification is based on a sequence, assumed to be probabilistic independent, of feature vectors extracted from signal generated by the object. Each feature vector is a base for calculation of a probability density function for each predefined class. The density functions are estimated by the Gaussian mixture model (GMM) and the t-student mixture model. The model parameters are estimated by algorithms based on the expectation-maximization (EM) method. The estimated densities calculated for a sequence of feature vectors are inputs to analyzed classification rules. These rules are derived from Bayes decision theory with some heuristic modifications. The performance of the proposed rules was tested in an automatic, text independent, speaker identification task. Achieved results are presented.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121961897","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}
引用次数: 0
期刊
5th International Conference on Intelligent Systems Design and Applications (ISDA'05)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1