default search action
Tetsuya Yoshida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c51]Tetsuya Yoshida
:
Alternating Approximation of Weave Diagrams under Heald Frame Constraint. IVSP 2023: 178-182 - 2022
- [j19]Rumi Iwai, Takunori Shimazaki
Quantification and Visualization of Reliable Hemodynamics Evaluation Based on Non-Contact Arteriovenous Fistula Measurement. Sensors 22(7): 2745 (2022)
2010 – 2019
- 2019
- [e4]Hakim Hacid, Quan Z. Sheng
Data Quality and Trust in Big Data - 5th International Workshop, QUAT 2018, Held in Conjunction with WISE 2018, Dubai, UAE, November 12-15, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11235, Springer 2019, ISBN 978-3-030-19142-9 [contents] - 2017
- [j18]Tetsuya Yoshida, Yuu Yamada:
A Community Structure-Based Approach for Network Immunization. Comput. Intell. 33(1): 77-98 (2017) - 2014
- [j17]Tetsuya Yoshida:
A Graph-Based Approach for Semisupervised Clustering. Comput. Intell. 30(2): 263-284 (2014) - [c50]Keiko Inoue, Tetsuya Yoshida, Masashi Kume:
Determination of the Optimum Muscle Temperature for Maintaining Work Performance with Attenuation of Heat Stress in Human. IIAI-AAI 2014: 795-800 - 2013
- [j16]Hakim Hacid, Tetsuya Yoshida, Cécile Favre:
Special issue on SIASP at ICDM 2010. J. Intell. Inf. Syst. 40(2): 185-187 (2013) - [j15]Tetsuya Yoshida:
Toward finding hidden communities based on user profile. J. Intell. Inf. Syst. 40(2): 189-209 (2013) - [j14]Tetsuya Yoshida:
Rectifying the representation learned by Non-negative Matrix Factorization. Int. J. Knowl. Based Intell. Eng. Syst. 17(4): 279-290 (2013) - [j13]Tetsuya Yoshida:
Weighted line graphs for overlapping community discovery. Soc. Netw. Anal. Min. 3(4): 1001-1013 (2013) - [c49]Tetsuya Yoshida:
Learning and Utilizing a Pool of Features in Non-negative Matrix Factorization. AMT 2013: 96-105 - [c48]Tetsuya Yoshida, Hiroki Ogino:
Theoretical Analysis and Evaluation of Topic Graph Based Transfer Learning. AMT 2013: 106-115 - [c47]Tetsuya Yoshida, Yuu Yamada:
Toward Robust and Fast Two-Dimensional Linear Discriminant Analysis. AMT 2013: 126-135 - [e3]Tetsuya Yoshida, Gang Kou, Andrzej Skowron, Jiannong Cao, Hakim Hacid, Ning Zhong:
Active Media Technology - 9th International Conference, AMT 2013, Maebashi, Japan, October 29-31, 2013, Proceedings. Lecture Notes in Computer Science 8210, Springer 2013, ISBN 978-3-319-02749-4 [contents] - [e2]Yuzuru Tanaka, Nicolas Spyratos, Tetsuya Yoshida, Carlo Meghini:
Information Search, Integration and Personalization - International Workshop, ISIP 2012, Sapporo, Japan, October 11-13, 2012. Revised Selected Papers. Communications in Computer and Information Science 146, Springer 2013, ISBN 978-3-642-40139-8 [contents] - 2012
- [j12]Tetsuya Yoshida, Hiroki Ogino:
A re-coloring approach for graph b-coloring based clustering. Int. J. Knowl. Based Intell. Eng. Syst. 16(2): 117-128 (2012) - [c46]Tetsuya Yoshida:
Influence of Erroneous Pairwise Constraints in Semi-supervised Clustering. AMT 2012: 43-52 - [c45]Yuu Yamada, Tetsuya Yoshida:
A Comparative Study of Community Structure Based Node Scores for Network Immunization. AMT 2012: 328-337 - [c44]Tetsuya Yoshida:
Weighted Line Graphs for Overlapping Community Discovery and their Evaluation. ISIP 2012: 121-130 - [c43]Tetsuya Yoshida:
Overlapping Community Discovery via Weighted Line Graphs of Networks. PRICAI 2012: 895-898 - [c42]Tetsuya Yoshida, Yuu Yamada:
Community Structure Based Node Scores for Network Immunization. PRICAI 2012: 899-902 - 2011
- [j11]Tetsuya Yoshida:
A graph model for mutual information based clustering. J. Intell. Inf. Syst. 37(2): 187-216 (2011) - [c41]Keigo Kimura, Tetsuya Yoshida:
Non-negative Matrix Factorization with sparse features. GrC 2011: 324-329 - [c40]Keigo Kimura, Tetsuya Yoshida:
Topic graph based transfer learning via generalized KL divergence based NMF. GrC 2011: 330-335 - [c39]Tetsuya Yoshida:
Regularized modularity eigenmap for community discovery with side information. GrC 2011: 779-784 - [c38]Tetsuya Yoshida:
Cholesky Decomposition Rectification for Non-negative Matrix Factorization. ISMIS 2011: 214-219 - [c37]Hiroki Ogino, Tetsuya Yoshida:
Topic Graph Based Non-negative Matrix Factorization for Transfer Learning. ISMIS 2011: 260-269 - [c36]Tetsuya Yoshida:
Pairwise Constraint Propagation for Graph-Based Semi-supervised Clustering. ISMIS 2011: 358-364 - 2010
- [j10]Hakim Hacid, Tetsuya Yoshida:
Neighborhood graphs for indexing and retrieving multi-dimensional data. J. Intell. Inf. Syst. 34(1): 93-111 (2010) - [c35]Hakim Hacid, Tetsuya Yoshida:
Construction Incrémentale de Graphes de Voisinage avec Accès Réduit aux Disques. AAFD 2010: 77-94 - [c34]Tetsuya Yoshida:
Performance Evaluation of Constraints in Graph-Based Semi-supervised Clustering. AMT 2010: 138-149 - [c33]Tetsuya Yoshida:
Toward Finding Hidden Communities Based on User Profile. ICDM Workshops 2010: 380-387 - [c32]Kreshnik Musaraj, Tetsuya Yoshida, Florian Daniel
Message Correlation and Web Service Protocol Mining from Inaccurate Logs. ICWS 2010: 259-266 - [c31]Tetsuya Yoshida, Kazuhiro Okatani:
A Graph-Based Projection Approach for Semi-supervised Clustering. PKAW 2010: 1-13 - [c30]Hiroki Ogino, Tetsuya Yoshida:
Toward Improving Re-coloring Based Clustering with Graph b-Coloring. PRICAI 2010: 206-218 - [c29]Tetsuya Yoshida:
A Graph Model for Clustering Based on Mutual Information. PRICAI 2010: 339-350
2000 – 2009
- 2009
- [j9]Tetsuya Yoshida, Hiroshi Yamada, Kenji Kono:
Using a Virtual Machine Monitor to Slow Down CPU Speed for Embedded Time-Sensitive Software Testing. Inf. Media Technol. 4(4): 870-884 (2009) - 2008
- [c28]Haytham Elghazel, Tetsuya Yoshida, Mohand-Said Hacid:
An Integrated Graph and Probability Based Clustering Framework for Sequential Data. Discovery Science 2008: 246-258 - 2007
- [j8]Tetsuya Yoshida:
Cooperation learning in Multi-Agent Systems with annotation and reward. Int. J. Knowl. Based Intell. Eng. Syst. 11(1): 19-34 (2007) - [c27]Hakim Hacid, Tetsuya Yoshida:
Incremental Neighborhood Graphs Construction for Multidimensional Databases Indexing. Canadian AI 2007: 405-416 - [c26]Tetsuya Yoshida, Hakim Hacid:
Neighborhood Graph Construction with Reduced Data Access for Large Scale Database Indexing. Artificial Intelligence and Pattern Recognition 2007: 307-312 - [c25]Haytham Elghazel, Tetsuya Yoshida, Véronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy:
A New Greedy Algorithm for Improving b-Coloring Clustering. GbRPR 2007: 228-239 - 2006
- [j7]Tetsuya Yoshida, Masato Watanabe, Shogo Nishida:
An image based design support system for web page design. Int. J. Knowl. Based Intell. Eng. Syst. 10(3): 201-212 (2006) - 2005
- [j6]Warodom Geamsakul, Tetsuya Yoshida, Kouzou Ohara, Hiroshi Motoda, Hideto Yokoi, Katsuhiko Takabayashi:
Constructing a Decision Tree for Graph-Structured Data and its Applications. Fundam. Informaticae 66(1-2): 131-160 (2005) - [j5]Tetsuya Yoshida, Daiki Shinkai, Shogo Nishida:
A document retrieval support system with term relationship. Web Intell. Agent Syst. 3(3): 171-182 (2005) - [c24]Tetsuya Yoshida, Akira Mogi, Kouzou Ohara, Hiroshi Motoda, Takashi Washio:
Refining diagnostic knowledge extracted from interferon therapy by graph-based induction. AMT 2005: 63-68 - [c23]Tetsuya Yoshida, Hiroshi Motoda:
Performance evaluation of fusing two different knowledge sources in Ripple Down Rules method. AMT 2005: 69-74 - [c22]Tetsuya Yoshida, Ryosuke Shoda, Hiroshi Motoda:
Graph Clustering Based on Structural Similarity of Fragments. Federation over the Web 2005: 97-114 - [e1]Hiroyuki Tarumi, Yuefeng Li, Tetsuya Yoshida:
Proceedings of the 2005 International Conference on Active Media Technology, AMT 2005, Kagawa International Conference Hall, Takamatsu, Kagawa, Japan, May 19-21, 2005. IEEE 2005, ISBN 0-7803-9035-0 [contents] - 2004
- [j4]Tetsuya Yoshida, Teruyuki Kondo, Shogo Nishida:
Detecting difference of usage of terms as difference of structure. Cogn. Syst. Res. 5(3): 223-240 (2004) - [j3]Tetsuya Yoshida, Takuya Wada, Hiroshi Motoda, Takashi Washio:
Adaptive Ripple Down Rules method based on minimum description length principle. Intell. Data Anal. 8(3): 239-265 (2004) - [j2]Kensuke Ohnishi, Tetsuya Yoshida, Shogo Nishida:
A method for detecting conceptual differences based on correlation between decision trees. Syst. Comput. Jpn. 35(2): 25-38 (2004) - [c21]Warodom Geamsakul, Takashi Matsuda, Tetsuya Yoshida, Kouzou Ohara, Hiroshi Motoda, Takashi Washio, Hideto Yokoi, Katsuhiko Takabayashi:
Analysis of Hepatitis Dataset by Decision Tree Based on Graph-Based Induction. JSAI Workshops 2004: 5-28 - 2003
- [c20]Warodom Geamsakul, Tetsuya Yoshida, Kouzou Ohara, Hiroshi Motoda, Takashi Washio, Hideto Yokoi, Katsuhiko Takabayashi:
Extracting Diagnostic Knowledge from Hepatitis Dataset by Decision Tree Graph-Based Induction. Active Mining 2003: 126-151 - [c19]Warodom Geamsakul, Takashi Matsuda, Tetsuya Yoshida, Hiroshi Motoda, Takashi Washio:
Performance Evaluation of Decision Tree Graph-Based Induction. Discovery Science 2003: 128-140 - [c18]Warodom Geamsakul, Takashi Matsuda, Tetsuya Yoshida, Hiroshi Motoda, Takashi Washio:
Classifier Construction by Graph-Based Induction for Graph-Structured Data. PAKDD 2003: 52-62 - 2002
- [c17]Takashi Matsuda, Hiroshi Motoda, Tetsuya Yoshida, Takashi Washio:
Mining Patterns from Structured Data by Beam-Wise Graph-Based Induction. Discovery Science 2002: 422-429 - [c16]Tetsuya Yoshida, Hiroshi Motoda, Takashi Washio:
Adaptive Ripple Down Rules Method based on Minimum Description Length Principle. ICDM 2002: 530-537 - [c15]Takuya Wada, Tetsuya Yoshida, Hiroshi Motoda, Takashi Washio:
Extension of the RDR Method That Can Adapt to Environmental Changes and Acquire Knowledge from Both Experts and Data. PRICAI 2002: 218-227 - [c14]Keisei Fujiwara, Tetsuya Yoshida, Hiroshi Motoda, Takashi Washio:
Case Generation Method for Constructing an RDR Knowledge Base. PRICAI 2002: 228-237 - [c13]Takashi Matsuda, Hiroshi Motoda, Tetsuya Yoshida, Takashi Washio:
Knowledge Discovery from Structured Data by Beam-Wise Graph-Based Induction. PRICAI 2002: 255-264 - 2001
- [j1]Tetsuya Yoshida, Teruyuki Kondo, Shogo Nishida:
Evolving Granules for Classification for Discovering Difference in the Usage of Words. Comput. Intell. 17(3): 580-592 (2001) - [c12]Yoshinori Hijikata, Tetsuya Yoshida, Shogo Nishida:
Adaptive Hypermedia System for Supporting Information Providers in Directing Users through Hyperspace. OHS-7/SC-3/AH-3 2001: 322-326 - [c11]Tetsuya Yoshida, Daiki Shinkai, Shogo Nishida:
Utilizing the Correlation between Query Keywords for Information Retrieval. WAIM 2001: 49-59
1990 – 1999
- 1999
- [c10]Tetsuya Yoshida, Teruyuki Kondo, Shogo Nishida:
Discovering Conceptual Differences among Different People via Diverse Structures. PAKDD 1999: 494-498 - [c9]Tetsuya Yoshida, Teruyuki Kondo, Shogo Nishida:
Evolving Granules for Classification for Discovering Difference in the Usage of Words. RSFDGrC 1999: 366-374 - 1998
- [c8]Takayuki Yamaoka, Katsuhiko Tsujino, Tetsuya Yoshida, Shogo Nishida:
Supporting Mutual Understanding in Collaborative Design Project. APCHI 1998: 132-138 - [c7]Tetsuya Yoshida, Teruyuki Kondo:
Discovering Conceptual Differences among People from Cases. Discovery Science 1998: 162-173 - [c6]Tetsuya Yoshida, Koichi Hori, Shinichi Nakasuka:
A Reinforcement Learning Approach to Cooperative Problem Solving. ICMAS 1998: 479-480 - [c5]Yoshinori Hijikata, Tetsuya Yoshida, Shogo Nishida:
A dynamic linkage method for hypermedia and its design support tool. SMC 1998: 1260-1265 - 1997
- [c4]Takashi Koiso, Naoki Saiwaki, Tetsuya Yoshida, Shogo Nishida:
Communication Model in Emergency Which Considers Competence, Duty and Responsibility. HCI (1) 1997: 49-52 - [c3]Teruyuki Kondo, Naoki Saiwaki, Tetsuya Yoshida, Shogo Nishida:
Interactive Interfaces to Detect Conceptual Difference for Knowledge Acquisition. HCI (2) 1997: 303-306 - [c2]Yoshinori Hijikata, Naoki Saiwaki, Tetsuya Yoshida, Shogo Nishida:
A Dynamic Linkage Method for Hypermedia and Its Design Support Tool. HCI (2) 1997: 727-730 - 1994
- [c1]Tetsuya Yoshida, Alan Bundy, Ian Green, Toby Walsh, David A. Basin:
Coloured Rippling: An Extension of a Theorem Proving Heuristic. ECAI 1994: 85-89
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-07 01:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: